Base | Representation |
---|---|
bin | 1001010111110010100110… |
… | …0001001010010110011111 |
3 | 1100111002020222211121210111 |
4 | 2111330221201022112133 |
5 | 2322311223203231421 |
6 | 33525423553150451 |
7 | 2112314506132123 |
oct | 225745141122637 |
9 | 40432228747714 |
10 | 10304323102111 |
11 | 3313047837985 |
12 | 11a5068b5b427 |
13 | 5999028049cc |
14 | 278a3648d583 |
15 | 12d08bdeaee1 |
hex | 95f2984a59f |
10304323102111 has 8 divisors (see below), whose sum is σ = 10425370557744. Its totient is φ = 10183648675200.
The previous prime is 10304323102067. The next prime is 10304323102201. The reversal of 10304323102111 is 11120132340301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10304323102111 - 27 = 10304323101983 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 (10304323109111) 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 7 ways as a sum of consecutive naturals, for example, 93201610 + ... + 93312103.
It is an arithmetic number, because the mean of its divisors is an integer number (1303171319718).
Almost surely, 210304323102111 is an apocalyptic number.
10304323102111 is a deficient number, since it is larger than the sum of its proper divisors (121047455633).
10304323102111 is a wasteful number, since it uses less digits than its factorization.
10304323102111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 186514361.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 10304323102111 its reverse (11120132340301), we get a palindrome (21424455442412).
The spelling of 10304323102111 in words is "ten trillion, three hundred four billion, three hundred twenty-three million, one hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •