Base | Representation |
---|---|
bin | 1010011101101111011101… |
… | …00011101000000100011010 |
3 | 10000110221100202021110011000 |
4 | 11032313232203220010122 |
5 | 11004012331340334432 |
6 | 120535344313245430 |
7 | 4563400222426251 |
oct | 516675643500432 |
9 | 100427322243130 |
10 | 23012142121242 |
11 | 737243833615a |
12 | 26b7aa7a03876 |
13 | cac060549161 |
14 | 597b179a9798 |
15 | 29d8ea57057c |
hex | 14edee8e811a |
23012142121242 has 32 divisors (see below), whose sum is σ = 51352060550400. Its totient is φ = 7638618998304.
The previous prime is 23012142121159. The next prime is 23012142121259. The reversal of 23012142121242 is 24212124121032.
23012142121242 is a `hidden beast` number, since 2 + 3 + 0 + 1 + 21 + 421 + 212 + 4 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
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 15 ways as a sum of consecutive naturals, for example, 891515923 + ... + 891541734.
It is an arithmetic number, because the mean of its divisors is an integer number (1604751892200).
Almost surely, 223012142121242 is an apocalyptic number.
23012142121242 is an abundant number, since it is smaller than the sum of its proper divisors (28339918429158).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23012142121242 is a wasteful number, since it uses less digits than its factorization.
23012142121242 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1783057907 (or 1783057901 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 27.
Adding to 23012142121242 its reverse (24212124121032), we get a palindrome (47224266242274).
The spelling of 23012142121242 in words is "twenty-three trillion, twelve billion, one hundred forty-two million, one hundred twenty-one thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •