Base | Representation |
---|---|
bin | 1001000110101010111110… |
… | …1011100001100001110001 |
3 | 1022102222010112021010111012 |
4 | 2101222233223201201301 |
5 | 2303001413113101001 |
6 | 33142344313200305 |
7 | 2052133420322330 |
oct | 221525753414161 |
9 | 38388115233435 |
10 | 10010221222001 |
11 | 320a346a06430 |
12 | 115806aa00095 |
13 | 577c62920690 |
14 | 2686d67d9d17 |
15 | 1255c744d2bb |
hex | 91aafae1871 |
10010221222001 has 64 divisors (see below), whose sum is σ = 13490117222400. Its totient is φ = 7173512236800.
The previous prime is 10010221221991. The next prime is 10010221222003. The reversal of 10010221222001 is 10022212201001.
10010221222001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-10010221222001 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10010221222003) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 354719270 + ... + 354747488.
It is an arithmetic number, because the mean of its divisors is an integer number (210783081600).
Almost surely, 210010221222001 is an apocalyptic number.
10010221222001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10010221222001 is a deficient number, since it is larger than the sum of its proper divisors (3479896000399).
10010221222001 is a wasteful number, since it uses less digits than its factorization.
10010221222001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29550.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 10010221222001 its reverse (10022212201001), we get a palindrome (20032433423002).
The spelling of 10010221222001 in words is "ten trillion, ten billion, two hundred twenty-one million, two hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.212 sec. • engine limits •