Base | Representation |
---|---|
bin | 1010100000111010110011… |
… | …00010010011111101001110 |
3 | 10000212101010221000020210212 |
4 | 11100131121202103331032 |
5 | 11012304421121334410 |
6 | 121101441140002422 |
7 | 4604313433551200 |
oct | 520353142237516 |
9 | 100771127006725 |
10 | 23121311121230 |
11 | 74047693a16a3 |
12 | 2715094390412 |
13 | cb943a82ac7a |
14 | 59d112674770 |
15 | 2a168971ab05 |
hex | 150759893f4e |
23121311121230 has 24 divisors (see below), whose sum is σ = 48413194307928. Its totient is φ = 7927306669968.
The previous prime is 23121311121229. The next prime is 23121311121323. The reversal of 23121311121230 is 3212111312132.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 23121311121196 and 23121311121205.
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 23593174124 + ... + 23593175103.
It is an arithmetic number, because the mean of its divisors is an integer number (2017216429497).
Almost surely, 223121311121230 is an apocalyptic number.
23121311121230 is an abundant number, since it is smaller than the sum of its proper divisors (25291883186698).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23121311121230 is a wasteful number, since it uses less digits than its factorization.
23121311121230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47186349248 (or 47186349241 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 23121311121230 its reverse (3212111312132), we get a palindrome (26333422433362).
The spelling of 23121311121230 in words is "twenty-three trillion, one hundred twenty-one billion, three hundred eleven million, one hundred twenty-one thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •