Base | Representation |
---|---|
bin | 1010101001000011111000… |
… | …00000011110111100010011 |
3 | 10001212010020021021010002002 |
4 | 11110201330000132330103 |
5 | 11031400333424031011 |
6 | 121434144415144215 |
7 | 4633446065601263 |
oct | 524417400367423 |
9 | 101763207233062 |
10 | 23401062330131 |
11 | 75023756914a2 |
12 | 275b34851506b |
13 | 1009931573885 |
14 | 5ac89044b7a3 |
15 | 2a8aae3b7c3b |
hex | 15487c01ef13 |
23401062330131 has 16 divisors (see below), whose sum is σ = 25249565337984. Its totient is φ = 21605147526144.
The previous prime is 23401062330103. The next prime is 23401062330161. The reversal of 23401062330131 is 13103326010432.
It is a cyclic number.
It is not a de Polignac number, because 23401062330131 - 214 = 23401062313747 is a prime.
It is a super-2 number, since 2×234010623301312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23401062330094 and 23401062330103.
It is not an unprimeable number, because it can be changed into a prime (23401062330161) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2801366 + ... + 7392548.
It is an arithmetic number, because the mean of its divisors is an integer number (1578097833624).
Almost surely, 223401062330131 is an apocalyptic number.
23401062330131 is a deficient number, since it is larger than the sum of its proper divisors (1848503007853).
23401062330131 is a wasteful number, since it uses less digits than its factorization.
23401062330131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4596910.
The product of its (nonzero) digits is 7776, while the sum is 29.
Adding to 23401062330131 its reverse (13103326010432), we get a palindrome (36504388340563).
The spelling of 23401062330131 in words is "twenty-three trillion, four hundred one billion, sixty-two million, three hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •