Base | Representation |
---|---|
bin | 101111001110001000… |
… | …1001110101010010000 |
3 | 100200202011022001101011 |
4 | 1132130101032222100 |
5 | 3130134414310000 |
6 | 114330230420304 |
7 | 10216635602011 |
oct | 1363421165220 |
9 | 320664261334 |
10 | 101406010000 |
11 | 3a00805a239 |
12 | 177a0801694 |
13 | 9740bb3919 |
14 | 4c9da99008 |
15 | 29878ba2ba |
hex | 179c44ea90 |
101406010000 has 50 divisors (see below), whose sum is σ = 245514115022. Its totient is φ = 40562400000.
The previous prime is 101406009967. The next prime is 101406010009. The reversal of 101406010000 is 10604101.
It can be written as a sum of positive squares in 5 ways, for example, as 75073808016 + 26332201984 = 273996^2 + 162272^2 .
It is a tau number, because it is divible by the number of its divisors (50).
It is not an unprimeable number, because it can be changed into a prime (101406010009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 5060301 + ... + 5080300.
Almost surely, 2101406010000 is an apocalyptic number.
101406010000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101406010000 is an abundant number, since it is smaller than the sum of its proper divisors (144108105022).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101406010000 is an equidigital number, since it uses as much as digits as its factorization.
101406010000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10140629 (or 10140608 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 101406010000 its reverse (10604101), we get a palindrome (101416614101).
The spelling of 101406010000 in words is "one hundred one billion, four hundred six million, ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •