Base | Representation |
---|---|
bin | 101111000010101000… |
… | …0101101111100000010 |
3 | 100122202020221201012120 |
4 | 1132011100231330002 |
5 | 3123342110000002 |
6 | 114224041105110 |
7 | 10204240555305 |
oct | 1360520557402 |
9 | 318666851176 |
10 | 101020000002 |
11 | 3992a17a209 |
12 | 176b3488196 |
13 | 96abc3003c |
14 | 4c646d6b3c |
15 | 2963a6bcbc |
hex | 178542df02 |
101020000002 has 8 divisors (see below), whose sum is σ = 202040000016. Its totient is φ = 33673333332.
The previous prime is 101019999991. The next prime is 101020000051. The reversal of 101020000002 is 200000020101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
101020000002 is an admirable number.
It is a Harshad number since it is a multiple of its sum of digits (6), and also a Moran number because the ratio is a prime number: 16836666667 = 101020000002 / (1 + 0 + 1 + 0 + 2 + 0 + 0 + 0 + 0 + 0 + 0 + 2).
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 8418333328 + ... + 8418333339.
It is an arithmetic number, because the mean of its divisors is an integer number (25255000002).
Almost surely, 2101020000002 is an apocalyptic number.
101020000002 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101020000002 is a wasteful number, since it uses less digits than its factorization.
101020000002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16836666672.
The product of its (nonzero) digits is 4, while the sum is 6.
Adding to 101020000002 its reverse (200000020101), we get a palindrome (301020020103).
The spelling of 101020000002 in words is "one hundred one billion, twenty million, two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •