Base | Representation |
---|---|
bin | 10101011011101000… |
… | …010001101010001110 |
3 | 2012101202100212210022 |
4 | 111123220101222032 |
5 | 334112100334410 |
6 | 14323245342142 |
7 | 1443155542310 |
oct | 253350215216 |
9 | 65352325708 |
10 | 23012121230 |
11 | 983981930a |
12 | 4562867952 |
13 | 22297443a7 |
14 | 11843657b0 |
15 | 8ea406455 |
hex | 55ba11a8e |
23012121230 has 128 divisors (see below), whose sum is σ = 53522270208. Its totient is φ = 6937362432.
The previous prime is 23012121203. The next prime is 23012121233. The reversal of 23012121230 is 3212121032.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is an alternating number because its digits alternate between even and odd.
It is a junction number, because it is equal to n+sod(n) for n = 23012121199 and 23012121208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23012121233) 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 63 ways as a sum of consecutive naturals, for example, 1167134 + ... + 1186686.
It is an arithmetic number, because the mean of its divisors is an integer number (418142736).
Almost surely, 223012121230 is an apocalyptic number.
23012121230 is an abundant number, since it is smaller than the sum of its proper divisors (30510148978).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23012121230 is a wasteful number, since it uses less digits than its factorization.
23012121230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19650.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 23012121230 its reverse (3212121032), we get a palindrome (26224242262).
The spelling of 23012121230 in words is "twenty-three billion, twelve million, one hundred twenty-one thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •