Base | Representation |
---|---|
bin | 1001011000111001110110… |
… | …0101111000000011001111 |
3 | 1100112220122000011012120121 |
4 | 2112032131211320003033 |
5 | 2323114411243122421 |
6 | 33542305544525411 |
7 | 2113562503153303 |
oct | 226163545700317 |
9 | 40486560135517 |
10 | 10323450364111 |
11 | 3320172664a25 |
12 | 11a8906780867 |
13 | 59b66043c911 |
14 | 27992c8b3d03 |
15 | 12d80b222d41 |
hex | 9639d9780cf |
10323450364111 has 4 divisors (see below), whose sum is σ = 10602462536152. Its totient is φ = 10044438192072.
The previous prime is 10323450364109. The next prime is 10323450364153. The reversal of 10323450364111 is 11146305432301.
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 10323450364111 - 21 = 10323450364109 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 (10323450364411) 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, 139506085965 + ... + 139506086038.
It is an arithmetic number, because the mean of its divisors is an integer number (2650615634038).
Almost surely, 210323450364111 is an apocalyptic number.
10323450364111 is a deficient number, since it is larger than the sum of its proper divisors (279012172041).
10323450364111 is an equidigital number, since it uses as much as digits as its factorization.
10323450364111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 279012172040.
The product of its (nonzero) digits is 25920, while the sum is 34.
Adding to 10323450364111 its reverse (11146305432301), we get a palindrome (21469755796412).
The spelling of 10323450364111 in words is "ten trillion, three hundred twenty-three billion, four hundred fifty million, three hundred sixty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •