Base | Representation |
---|---|
bin | 10110111110000010001101… |
… | …010101011100110000101010 |
3 | 111020200102021122001110020111 |
4 | 112332002031111130300222 |
5 | 101220102431003342302 |
6 | 554503540453444534 |
7 | 30164311552165540 |
oct | 2676021525346052 |
9 | 436612248043214 |
10 | 101020002012202 |
11 | 2a208384605969 |
12 | b3b642a34074a |
13 | 444a1b7342260 |
14 | 1ad3573905d90 |
15 | ba2b6704d0d7 |
hex | 5be08d55cc2a |
101020002012202 has 32 divisors (see below), whose sum is σ = 186500073723264. Its totient is φ = 39963612168000.
The previous prime is 101020002012187. The next prime is 101020002012203. The reversal of 101020002012202 is 202210200020101.
It is a happy number.
It is a super-2 number, since 2×1010200020122022 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is not an unprimeable number, because it can be changed into a prime (101020002012203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19305877 + ... + 23974087.
It is an arithmetic number, because the mean of its divisors is an integer number (5828127303852).
Almost surely, 2101020002012202 is an apocalyptic number.
101020002012202 is a deficient number, since it is larger than the sum of its proper divisors (85480071711062).
101020002012202 is a wasteful number, since it uses less digits than its factorization.
101020002012202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4787134.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 101020002012202 its reverse (202210200020101), we get a palindrome (303230202032303).
The spelling of 101020002012202 in words is "one hundred one trillion, twenty billion, two million, twelve thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •