Base | Representation |
---|---|
bin | 11101010011001100… |
… | …010011011011010100 |
3 | 10000012112111021000000 |
4 | 131103030103123110 |
5 | 1003412342132200 |
6 | 22241443451300 |
7 | 2162422611540 |
oct | 352314233324 |
9 | 100175437000 |
10 | 31460505300 |
11 | 123846a9304 |
12 | 6120086b30 |
13 | 2c74b39813 |
14 | 17463caa20 |
15 | c41e71300 |
hex | 7533136d4 |
31460505300 has 252 divisors, whose sum is σ = 116981464096. Its totient is φ = 7190856000.
The previous prime is 31460505239. The next prime is 31460505317. The reversal of 31460505300 is 350506413.
31460505300 is a `hidden beast` number, since 3 + 1 + 4 + 605 + 0 + 53 + 0 + 0 = 666.
It is a tau number, because it is divible by the number of its divisors (252).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 83 ways as a sum of consecutive naturals, for example, 479475 + ... + 541125.
Almost surely, 231460505300 is an apocalyptic number.
31460505300 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 31460505300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (58490732048).
31460505300 is an abundant number, since it is smaller than the sum of its proper divisors (85520958796).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31460505300 is a wasteful number, since it uses less digits than its factorization.
31460505300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61690 (or 61668 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 27.
The spelling of 31460505300 in words is "thirty-one billion, four hundred sixty million, five hundred five thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •