Base | Representation |
---|---|
bin | 1010100000011001011100… |
… | …00100100110001010011011 |
3 | 10000210122220210220202122112 |
4 | 11100030232010212022123 |
5 | 11012011231410321021 |
6 | 121045320102142535 |
7 | 4603110561105224 |
oct | 520145604461233 |
9 | 100718823822575 |
10 | 23103402042011 |
11 | 73a810916a385 |
12 | 2711716721a4b |
13 | cb78453b2785 |
14 | 59c2d3d5424b |
15 | 2a0e8c321d5b |
hex | 15032e12629b |
23103402042011 has 8 divisors (see below), whose sum is σ = 24107949540864. Its totient is φ = 22098858856360.
The previous prime is 23103402041987. The next prime is 23103402042023. The reversal of 23103402042011 is 11024020430132.
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 23103402042011 - 242 = 18705355530907 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is not an unprimeable number, because it can be changed into a prime (23103402042041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14914190 + ... + 16390236.
It is an arithmetic number, because the mean of its divisors is an integer number (3013493692608).
Almost surely, 223103402042011 is an apocalyptic number.
23103402042011 is a deficient number, since it is larger than the sum of its proper divisors (1004547498853).
23103402042011 is a wasteful number, since it uses less digits than its factorization.
23103402042011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2156601.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 23103402042011 its reverse (11024020430132), we get a palindrome (34127422472143).
The spelling of 23103402042011 in words is "twenty-three trillion, one hundred three billion, four hundred two million, forty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •