Base | Representation |
---|---|
bin | 101111001110000001… |
… | …1011101010100011110 |
3 | 100200201220111122102120 |
4 | 1132130003131110132 |
5 | 3130133003300110 |
6 | 114330021203410 |
7 | 10216563115221 |
oct | 1363403352436 |
9 | 320656448376 |
10 | 101402400030 |
11 | 3a006013a98 |
12 | 1779b560566 |
13 | 974021b749 |
14 | 4c9d3d95b8 |
15 | 2987405870 |
hex | 179c0dd51e |
101402400030 has 16 divisors (see below), whose sum is σ = 243365760144. Its totient is φ = 27040640000.
The previous prime is 101402400017. The next prime is 101402400067. The reversal of 101402400030 is 30004204101.
101402400030 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 101402399982 and 101402400009.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1690039971 + ... + 1690040030.
It is an arithmetic number, because the mean of its divisors is an integer number (15210360009).
Almost surely, 2101402400030 is an apocalyptic number.
101402400030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101402400030 is an abundant number, since it is smaller than the sum of its proper divisors (141963360114).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101402400030 is a wasteful number, since it uses less digits than its factorization.
101402400030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3380080011.
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 101402400030 its reverse (30004204101), we get a palindrome (131406604131).
The spelling of 101402400030 in words is "one hundred one billion, four hundred two million, four hundred thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •