Base | Representation |
---|---|
bin | 1010011101110101100001… |
… | …11000010100010011101111 |
3 | 10000111020202221220222020220 |
4 | 11032322300320110103233 |
5 | 11004041020443401411 |
6 | 120541044014542423 |
7 | 4563544060623201 |
oct | 516726070242357 |
9 | 100436687828226 |
10 | 23015402325231 |
11 | 7373860669718 |
12 | 26b8657807a13 |
13 | cac45cb06744 |
14 | 597d46986771 |
15 | 29da3b8b1b06 |
hex | 14eeb0e144ef |
23015402325231 has 32 divisors (see below), whose sum is σ = 31873856555520. Its totient is φ = 14754564720000.
The previous prime is 23015402325187. The next prime is 23015402325257. The reversal of 23015402325231 is 13252320451032.
It is a de Polignac number, because none of the positive numbers 2k-23015402325231 is a prime.
It is a super-2 number, since 2×230154023252312 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 23015402325192 and 23015402325201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23015402323231) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 587242846 + ... + 587282036.
It is an arithmetic number, because the mean of its divisors is an integer number (996058017360).
Almost surely, 223015402325231 is an apocalyptic number.
23015402325231 is a deficient number, since it is larger than the sum of its proper divisors (8858454230289).
23015402325231 is a wasteful number, since it uses less digits than its factorization.
23015402325231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66367.
The product of its (nonzero) digits is 43200, while the sum is 33.
Adding to 23015402325231 its reverse (13252320451032), we get a palindrome (36267722776263).
The spelling of 23015402325231 in words is "twenty-three trillion, fifteen billion, four hundred two million, three hundred twenty-five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •