Base | Representation |
---|---|
bin | 10001101000000011000… |
… | …111101101011000100111 |
3 | 11021210101220211020111011 |
4 | 101220003013231120213 |
5 | 124321101140130043 |
6 | 2324233253323051 |
7 | 153336325506160 |
oct | 21500307553047 |
9 | 4253356736434 |
10 | 1211233130023 |
11 | 427754585a24 |
12 | 1768b3636487 |
13 | 8a2ac8c91c7 |
14 | 428a4362767 |
15 | 21790e7a59d |
hex | 11a031ed627 |
1211233130023 has 16 divisors (see below), whose sum is σ = 1462736148480. Its totient is φ = 980490303936.
The previous prime is 1211233129993. The next prime is 1211233130077. The reversal of 1211233130023 is 3200313321121.
It is a cyclic number.
It is not a de Polignac number, because 1211233130023 - 217 = 1211232998951 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1211233129976 and 1211233130003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1211233131023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 47602390 + ... + 47627827.
It is an arithmetic number, because the mean of its divisors is an integer number (91421009280).
Almost surely, 21211233130023 is an apocalyptic number.
1211233130023 is a deficient number, since it is larger than the sum of its proper divisors (251503018457).
1211233130023 is an equidigital number, since it uses as much as digits as its factorization.
1211233130023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95230326.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 1211233130023 its reverse (3200313321121), we get a palindrome (4411546451144).
The spelling of 1211233130023 in words is "one trillion, two hundred eleven billion, two hundred thirty-three million, one hundred thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •