Base | Representation |
---|---|
bin | 1001000110101010111110… |
… | …0111001111110110011101 |
3 | 1022102222010110011011210102 |
4 | 2101222233213033312131 |
5 | 2303001412321213041 |
6 | 33142344233150445 |
7 | 2052133404643220 |
oct | 221525747176635 |
9 | 38388113134712 |
10 | 10010220101021 |
11 | 320a3463101a8 |
12 | 115806a55b425 |
13 | 577c6261a38a |
14 | 2686d65c75b7 |
15 | 1255c72cb09b |
hex | 91aaf9cfd9d |
10010220101021 has 8 divisors (see below), whose sum is σ = 11719282069824. Its totient is φ = 8370915763680.
The previous prime is 10010220100927. The next prime is 10010220101033. The reversal of 10010220101021 is 12010102201001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10010220101021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10010220100993 and 10010220101011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10010220101081) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17439407555 + ... + 17439408128.
It is an arithmetic number, because the mean of its divisors is an integer number (1464910258728).
Almost surely, 210010220101021 is an apocalyptic number.
It is an amenable number.
10010220101021 is a deficient number, since it is larger than the sum of its proper divisors (1709061968803).
10010220101021 is an equidigital number, since it uses as much as digits as its factorization.
10010220101021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34878815731.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10010220101021 its reverse (12010102201001), we get a palindrome (22020322302022).
The spelling of 10010220101021 in words is "ten trillion, ten billion, two hundred twenty million, one hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •