Base | Representation |
---|---|
bin | 1110111100010110… |
… | …0110000010001011 |
3 | 101100112211010221121 |
4 | 3233011212002023 |
5 | 31203333034011 |
6 | 1502010220111 |
7 | 201254550151 |
oct | 35705460213 |
9 | 11315733847 |
10 | 4011221131 |
11 | 1779258895 |
12 | 93b424637 |
13 | 4bc050038 |
14 | 2a0a353d1 |
15 | 18723ee71 |
hex | ef16608b |
4011221131 has 2 divisors, whose sum is σ = 4011221132. Its totient is φ = 4011221130.
The previous prime is 4011221069. The next prime is 4011221147. The reversal of 4011221131 is 1311221104.
4011221131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (4011221147) can be obtained adding 4011221131 to its sum of digits (16).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 4011221131 - 219 = 4010696843 is a prime.
It is a super-2 number, since 2×40112211312 = 32179789923561838322, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (4011225131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2005610565 + 2005610566.
It is an arithmetic number, because the mean of its divisors is an integer number (2005610566).
Almost surely, 24011221131 is an apocalyptic number.
4011221131 is a deficient number, since it is larger than the sum of its proper divisors (1).
4011221131 is an equidigital number, since it uses as much as digits as its factorization.
4011221131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 16.
The square root of 4011221131 is about 63334.2019054476. The cubic root of 4011221131 is about 1588.8840356981.
Adding to 4011221131 its reverse (1311221104), we get a palindrome (5322442235).
The spelling of 4011221131 in words is "four billion, eleven million, two hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •