Base | Representation |
---|---|
bin | 1110001111100100010011… |
… | …10010000000100000111010 |
3 | 11002220021112012020212111020 |
4 | 13013302021302000200322 |
5 | 13101131321024012310 |
6 | 150340433333243310 |
7 | 6411611600465403 |
oct | 707621162004072 |
9 | 132807465225436 |
10 | 31321213110330 |
11 | 9a86285292a90 |
12 | 361a316a93536 |
13 | 1462768345c80 |
14 | 7a3d51da09aa |
15 | 394b0b1e5170 |
hex | 1c7c89c8083a |
31321213110330 has 128 divisors (see below), whose sum is σ = 88315882986240. Its totient is φ = 7008688527360.
The previous prime is 31321213110329. The next prime is 31321213110367. The reversal of 31321213110330 is 3301131212313.
It is a self number, because there is not a number n which added to its sum of digits gives 31321213110330.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 133958566 + ... + 134192174.
It is an arithmetic number, because the mean of its divisors is an integer number (689967835830).
Almost surely, 231321213110330 is an apocalyptic number.
31321213110330 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
31321213110330 is an abundant number, since it is smaller than the sum of its proper divisors (56994669875910).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31321213110330 is a wasteful number, since it uses less digits than its factorization.
31321213110330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 264896.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 31321213110330 its reverse (3301131212313), we get a palindrome (34622344322643).
The spelling of 31321213110330 in words is "thirty-one trillion, three hundred twenty-one billion, two hundred thirteen million, one hundred ten thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •