Base | Representation |
---|---|
bin | 11110000000101000101… |
… | …00010110111101110110 |
3 | 10122120112102201022222210 |
4 | 33000110110112331312 |
5 | 113343230024013220 |
6 | 2105410155234250 |
7 | 134332303106043 |
oct | 17002424267566 |
9 | 3576472638883 |
10 | 1031133032310 |
11 | 368334795967 |
12 | 147a10448986 |
13 | 7630a308854 |
14 | 37c9b14c1ca |
15 | 1bc4ea9d6e0 |
hex | f014516f76 |
1031133032310 has 32 divisors (see below), whose sum is σ = 2582315769600. Its totient is φ = 263013642848.
The previous prime is 1031133032269. The next prime is 1031133032329. The reversal of 1031133032310 is 132303311301.
1031133032310 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×10311330323102 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 747197160 + ... + 747198539.
It is an arithmetic number, because the mean of its divisors is an integer number (80697367800).
Almost surely, 21031133032310 is an apocalyptic number.
1031133032310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1031133032310 is an abundant number, since it is smaller than the sum of its proper divisors (1551182737290).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1031133032310 is a wasteful number, since it uses less digits than its factorization.
1031133032310 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1494395732.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 1031133032310 its reverse (132303311301), we get a palindrome (1163436343611).
The spelling of 1031133032310 in words is "one trillion, thirty-one billion, one hundred thirty-three million, thirty-two thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •