Base | Representation |
---|---|
bin | 111100010001001… |
… | …101111001010001 |
3 | 2121110122112222202 |
4 | 330101031321101 |
5 | 4032323140241 |
6 | 244200212545 |
7 | 34025413313 |
oct | 7421157121 |
9 | 2543575882 |
10 | 1011146321 |
11 | 479847219 |
12 | 24276a155 |
13 | 131640743 |
14 | 9840d7b3 |
15 | 5db83d9b |
hex | 3c44de51 |
1011146321 has 2 divisors, whose sum is σ = 1011146322. Its totient is φ = 1011146320.
The previous prime is 1011146317. The next prime is 1011146327. The reversal of 1011146321 is 1236411101.
It is a happy number.
1011146321 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 850363921 + 160782400 = 29161^2 + 12680^2 .
It is a cyclic number.
It is not a de Polignac number, because 1011146321 - 22 = 1011146317 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1011146293 and 1011146302.
It is not a weakly prime, because it can be changed into another prime (1011146327) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505573160 + 505573161.
It is an arithmetic number, because the mean of its divisors is an integer number (505573161).
Almost surely, 21011146321 is an apocalyptic number.
It is an amenable number.
1011146321 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011146321 is an equidigital number, since it uses as much as digits as its factorization.
1011146321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 20.
The square root of 1011146321 is about 31798.5270256344. The cubic root of 1011146321 is about 1003.7017206894.
Adding to 1011146321 its reverse (1236411101), we get a palindrome (2247557422).
The spelling of 1011146321 in words is "one billion, eleven million, one hundred forty-six thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •