Base | Representation |
---|---|
bin | 1110001001101111100111… |
… | …11010000001001101101010 |
3 | 11002012011002001211110120120 |
4 | 13010313303322001031222 |
5 | 13034342033303213310 |
6 | 150104503320504110 |
7 | 6361266421313130 |
oct | 704676372011552 |
9 | 132164061743516 |
10 | 31121130132330 |
11 | 9a094406a7227 |
12 | 35a759761b036 |
13 | 144992ca930b4 |
14 | 7983b0c7d750 |
15 | 38e7ea82eb70 |
hex | 1c4df3e8136a |
31121130132330 has 64 divisors (see below), whose sum is σ = 85361512642560. Its totient is φ = 7113342959424.
The previous prime is 31121130132229. The next prime is 31121130132341. The reversal of 31121130132330 is 3323103112113.
It is a super-2 number, since 2×311211301323302 (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 31121130132330.
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, 28414611 + ... + 29489529.
It is an arithmetic number, because the mean of its divisors is an integer number (1333773635040).
Almost surely, 231121130132330 is an apocalyptic number.
31121130132330 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
31121130132330 is an abundant number, since it is smaller than the sum of its proper divisors (54240382510230).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31121130132330 is a wasteful number, since it uses less digits than its factorization.
31121130132330 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1212803.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 31121130132330 its reverse (3323103112113), we get a palindrome (34444233244443).
The spelling of 31121130132330 in words is "thirty-one trillion, one hundred twenty-one billion, one hundred thirty million, one hundred thirty-two thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •