Base | Representation |
---|---|
bin | 101111000010101000… |
… | …0110000011011011001 |
3 | 100122202020222020012022 |
4 | 1132011100300123121 |
5 | 3123342110311301 |
6 | 114224041224225 |
7 | 10204240630115 |
oct | 1360520603331 |
9 | 318666866168 |
10 | 101020010201 |
11 | 3992a186940 |
12 | 176b3492075 |
13 | 96abc34886 |
14 | 4c646da745 |
15 | 2963a6ed1b |
hex | 17854306d9 |
101020010201 has 16 divisors (see below), whose sum is σ = 112117824000. Its totient is φ = 90244118400.
The previous prime is 101020010173. The next prime is 101020010219. The reversal of 101020010201 is 102010020101.
It is a cyclic number.
It is not a de Polignac number, because 101020010201 - 26 = 101020010137 is a prime.
It is a super-2 number, since 2×1010200102012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101020010251) 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 15 ways as a sum of consecutive naturals, for example, 632120 + ... + 775638.
It is an arithmetic number, because the mean of its divisors is an integer number (7007364000).
Almost surely, 2101020010201 is an apocalyptic number.
101020010201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101020010201 is a deficient number, since it is larger than the sum of its proper divisors (11097813799).
101020010201 is a wasteful number, since it uses less digits than its factorization.
101020010201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144640.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 101020010201 its reverse (102010020101), we get a palindrome (203030030302).
The spelling of 101020010201 in words is "one hundred one billion, twenty million, ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •