Base | Representation |
---|---|
bin | 1001000111011011110001… |
… | …1100001101001010001111 |
3 | 1022111012221102022202212001 |
4 | 2101312330130031022033 |
5 | 2303210224433241421 |
6 | 33152352202053131 |
7 | 2053106135025013 |
oct | 221667434151217 |
9 | 38435842282761 |
10 | 10023320212111 |
11 | 3214958a52598 |
12 | 115a7057aa1a7 |
13 | 57926c6712bb |
14 | 2691ba372543 |
15 | 125ae2405691 |
hex | 91dbc70d28f |
10023320212111 has 4 divisors (see below), whose sum is σ = 10126653410272. Its totient is φ = 9919987013952.
The previous prime is 10023320212033. The next prime is 10023320212127. The reversal of 10023320212111 is 11121202332001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10023320212111 - 241 = 7824296956559 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10023320212141) 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 3 ways as a sum of consecutive naturals, for example, 51666598935 + ... + 51666599128.
It is an arithmetic number, because the mean of its divisors is an integer number (2531663352568).
Almost surely, 210023320212111 is an apocalyptic number.
10023320212111 is a deficient number, since it is larger than the sum of its proper divisors (103333198161).
10023320212111 is an equidigital number, since it uses as much as digits as its factorization.
10023320212111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103333198160.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 10023320212111 its reverse (11121202332001), we get a palindrome (21144522544112).
The spelling of 10023320212111 in words is "ten trillion, twenty-three billion, three hundred twenty million, two hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •