Base | Representation |
---|---|
bin | 11110000000110001111… |
… | …10100110001000010010 |
3 | 10122120201212211100012010 |
4 | 33000120332212020102 |
5 | 113343410032311310 |
6 | 2105422031043350 |
7 | 134334242455044 |
oct | 17003076461022 |
9 | 3576655740163 |
10 | 1031211213330 |
11 | 368374934481 |
12 | 147a32670556 |
13 | 7632057cccc |
14 | 37ca769da94 |
15 | 1bc56893320 |
hex | f018fa6212 |
1031211213330 has 32 divisors (see below), whose sum is σ = 2474957232000. Its totient is φ = 274984065792.
The previous prime is 1031211213281. The next prime is 1031211213343. The reversal of 1031211213330 is 333121121301.
It is a happy number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1031211213297 and 1031211213306.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1274346 + ... + 1919994.
It is an arithmetic number, because the mean of its divisors is an integer number (77342413500).
Almost surely, 21031211213330 is an apocalyptic number.
1031211213330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1031211213330 is an abundant number, since it is smaller than the sum of its proper divisors (1443746018670).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1031211213330 is a wasteful number, since it uses less digits than its factorization.
1031211213330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 698898.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 1031211213330 its reverse (333121121301), we get a palindrome (1364332334631).
The spelling of 1031211213330 in words is "one trillion, thirty-one billion, two hundred eleven million, two hundred thirteen thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •