Base | Representation |
---|---|
bin | 10101100001110001… |
… | …010011101100001101 |
3 | 2012122221020101121222 |
4 | 111201301103230031 |
5 | 334314434332031 |
6 | 14341405533125 |
7 | 1445546360054 |
oct | 254161235415 |
9 | 65587211558 |
10 | 23115152141 |
11 | 989199aa24 |
12 | 45912741a5 |
13 | 2244ba9623 |
14 | 1193d0539b |
15 | 9044a8e7b |
hex | 561c53b0d |
23115152141 has 4 divisors (see below), whose sum is σ = 23216091900. Its totient is φ = 23014212384.
The previous prime is 23115152129. The next prime is 23115152167. The reversal of 23115152141 is 14125151132.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 20464446916 + 2650705225 = 143054^2 + 51485^2 .
It is a cyclic number.
It is not a de Polignac number, because 23115152141 - 210 = 23115151117 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 23115152141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23115152341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 50469536 + ... + 50469993.
It is an arithmetic number, because the mean of its divisors is an integer number (5804022975).
Almost surely, 223115152141 is an apocalyptic number.
It is an amenable number.
23115152141 is a deficient number, since it is larger than the sum of its proper divisors (100939759).
23115152141 is a wasteful number, since it uses less digits than its factorization.
23115152141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100939758.
The product of its digits is 1200, while the sum is 26.
The spelling of 23115152141 in words is "twenty-three billion, one hundred fifteen million, one hundred fifty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •