Base | Representation |
---|---|
bin | 1110001111110100111010… |
… | …10101011100101001111010 |
3 | 11002221010112201000210200020 |
4 | 13013322131111130221322 |
5 | 13101303102030233310 |
6 | 150344510304551310 |
7 | 6412345566251154 |
oct | 707723525345172 |
9 | 132833481023606 |
10 | 31330131102330 |
11 | 9a8a041261405 |
12 | 361bba5622536 |
13 | 1463559b11c08 |
14 | 7a455a549ad4 |
15 | 394e7e0c3170 |
hex | 1c7e9d55ca7a |
31330131102330 has 64 divisors (see below), whose sum is σ = 76039834492800. Its totient is φ = 8260539330560.
The previous prime is 31330131102251. The next prime is 31330131102359. The reversal of 31330131102330 is 3320113103313.
It is a super-2 number, since 2×313301311023302 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 31330131102330.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 82262281 + ... + 82642259.
It is an arithmetic number, because the mean of its divisors is an integer number (1188122413950).
Almost surely, 231330131102330 is an apocalyptic number.
31330131102330 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
31330131102330 is an abundant number, since it is smaller than the sum of its proper divisors (44709703390470).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31330131102330 is a wasteful number, since it uses less digits than its factorization.
31330131102330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 410959.
The product of its (nonzero) digits is 1458, while the sum is 24.
Adding to 31330131102330 its reverse (3320113103313), we get a palindrome (34650244205643).
The spelling of 31330131102330 in words is "thirty-one trillion, three hundred thirty billion, one hundred thirty-one million, one hundred two thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •