Base | Representation |
---|---|
bin | 1001001100000001010010… |
… | …1111111110011011101001 |
3 | 1022202202022111110201101202 |
4 | 2103000110233332123221 |
5 | 2311003110431413001 |
6 | 33252502410253545 |
7 | 2061565506260621 |
oct | 223002457763351 |
9 | 38682274421352 |
10 | 10102111201001 |
11 | 3245310458736 |
12 | 1171a347272b5 |
13 | 583818178211 |
14 | 26cd32713881 |
15 | 127ba46a896b |
hex | 93014bfe6e9 |
10102111201001 has 32 divisors (see below), whose sum is σ = 11252828510208. Its totient is φ = 9025066552320.
The previous prime is 10102111200959. The next prime is 10102111201031. The reversal of 10102111201001 is 10010211120101.
It is a cyclic number.
It is not a de Polignac number, because 10102111201001 - 226 = 10102044092137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10102111201031) 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 31 ways as a sum of consecutive naturals, for example, 105168071 + ... + 105264083.
It is an arithmetic number, because the mean of its divisors is an integer number (351650890944).
Almost surely, 210102111201001 is an apocalyptic number.
It is an amenable number.
10102111201001 is a deficient number, since it is larger than the sum of its proper divisors (1150717309207).
10102111201001 is a wasteful number, since it uses less digits than its factorization.
10102111201001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99881.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 10102111201001 its reverse (10010211120101), we get a palindrome (20112322321102).
It can be divided in two parts, 1010211120100 and 1, that added together give a palindrome (1010211120101).
The spelling of 10102111201001 in words is "ten trillion, one hundred two billion, one hundred eleven million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •