Base | Representation |
---|---|
bin | 1010100000111011000001… |
… | …01101001110110010000010 |
3 | 10000212101110022101021100211 |
4 | 11100131200231032302002 |
5 | 11012310142421033010 |
6 | 121101501114304334 |
7 | 4604316424243414 |
oct | 520354055166202 |
9 | 100771408337324 |
10 | 23121431424130 |
11 | 740482029aa86 |
12 | 27151087280aa |
13 | cb945972ca10 |
14 | 59d12462c9b4 |
15 | 2a169508108a |
hex | 150760b4ec82 |
23121431424130 has 64 divisors (see below), whose sum is σ = 44998025022720. Its totient is φ = 8503261814016.
The previous prime is 23121431424109. The next prime is 23121431424131. The reversal of 23121431424130 is 3142413412132.
It is a happy number.
It is a super-2 number, since 2×231214314241302 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 23121431424092 and 23121431424101.
It is not an unprimeable number, because it can be changed into a prime (23121431424131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 84812019 + ... + 85084201.
It is an arithmetic number, because the mean of its divisors is an integer number (703094140980).
Almost surely, 223121431424130 is an apocalyptic number.
23121431424130 is a deficient number, since it is larger than the sum of its proper divisors (21876593598590).
23121431424130 is a wasteful number, since it uses less digits than its factorization.
23121431424130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 274795.
The product of its (nonzero) digits is 13824, while the sum is 31.
Adding to 23121431424130 its reverse (3142413412132), we get a palindrome (26263844836262).
The spelling of 23121431424130 in words is "twenty-three trillion, one hundred twenty-one billion, four hundred thirty-one million, four hundred twenty-four thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •