Base | Representation |
---|---|
bin | 1110001100000110101000… |
… | …01011110010111110101010 |
3 | 11002110220100010102022120110 |
4 | 13012003110023302332222 |
5 | 13042204102242102310 |
6 | 150210032134435150 |
7 | 6400166442342015 |
oct | 706032413627652 |
9 | 132426303368513 |
10 | 31202202300330 |
11 | 9a3a863838a66 |
12 | 35bb242502ab6 |
13 | 1454480082639 |
14 | 79c2a219037c |
15 | 391992ed7d20 |
hex | 1c60d42f2faa |
31202202300330 has 64 divisors (see below), whose sum is σ = 74911871664000. Its totient is φ = 8317633858560.
The previous prime is 31202202300293. The next prime is 31202202300371. The reversal of 31202202300330 is 3300320220213.
It is a junction number, because it is equal to n+sod(n) for n = 31202202300297 and 31202202300306.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1348922865 + ... + 1348945995.
It is an arithmetic number, because the mean of its divisors is an integer number (1170497994750).
Almost surely, 231202202300330 is an apocalyptic number.
31202202300330 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
31202202300330 is an abundant number, since it is smaller than the sum of its proper divisors (43709669363670).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31202202300330 is a wasteful number, since it uses less digits than its factorization.
31202202300330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37159.
The product of its (nonzero) digits is 1296, while the sum is 21.
Adding to 31202202300330 its reverse (3300320220213), we get a palindrome (34502522520543).
The spelling of 31202202300330 in words is "thirty-one trillion, two hundred two billion, two hundred two million, three hundred thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •