Base | Representation |
---|---|
bin | 101111000010101000… |
… | …1100001001101011010 |
3 | 100122202021100101021122 |
4 | 1132011101201031122 |
5 | 3123342133210020 |
6 | 114224045405242 |
7 | 10204242421466 |
oct | 1360521411532 |
9 | 318667311248 |
10 | 101020210010 |
11 | 3992a302a75 |
12 | 176b3569822 |
13 | 96abca47c5 |
14 | 4c6474d4a6 |
15 | 2963aae125 |
hex | 178546135a |
101020210010 has 8 divisors (see below), whose sum is σ = 181836378036. Its totient is φ = 40408084000.
The previous prime is 101020210003. The next prime is 101020210033. The reversal of 101020210010 is 10012020101.
101020210010 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 100452865249 + 567344761 = 316943^2 + 23819^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 101020210010.
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, 5051010491 + ... + 5051010510.
Almost surely, 2101020210010 is an apocalyptic number.
101020210010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101020210010 is a deficient number, since it is larger than the sum of its proper divisors (80816168026).
101020210010 is a wasteful number, since it uses less digits than its factorization.
101020210010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10102021008.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 101020210010 its reverse (10012020101), we get a palindrome (111032230111).
The spelling of 101020210010 in words is "one hundred one billion, twenty million, two hundred ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •