Base | Representation |
---|---|
bin | 1001000111011100010001… |
… | …0100110110011111111011 |
3 | 1022111020021122020210110222 |
4 | 2101313010110312133323 |
5 | 2303211012320031021 |
6 | 33152413245330255 |
7 | 2053112332333604 |
oct | 221670424663773 |
9 | 38436248223428 |
10 | 10023452502011 |
11 | 3214a16698993 |
12 | 115a741b6698b |
13 | 579290bac150 |
14 | 2691cdb6adab |
15 | 125aedd376ab |
hex | 91dc45367fb |
10023452502011 has 4 divisors (see below), whose sum is σ = 10794487309872. Its totient is φ = 9252417694152.
The previous prime is 10023452501999. The next prime is 10023452502023. The reversal of 10023452502011 is 11020525432001.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (10023452501999) and next prime (10023452502023).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10023452502011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10023452402011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 385517403911 + ... + 385517403936.
It is an arithmetic number, because the mean of its divisors is an integer number (2698621827468).
Almost surely, 210023452502011 is an apocalyptic number.
10023452502011 is a deficient number, since it is larger than the sum of its proper divisors (771034807861).
10023452502011 is an equidigital number, since it uses as much as digits as its factorization.
10023452502011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 771034807860.
The product of its (nonzero) digits is 2400, while the sum is 26.
Adding to 10023452502011 its reverse (11020525432001), we get a palindrome (21043977934012).
The spelling of 10023452502011 in words is "ten trillion, twenty-three billion, four hundred fifty-two million, five hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •