Base | Representation |
---|---|
bin | 1011010001110101110011… |
… | …1100110111001011110110 |
3 | 1121220112111002000120010110 |
4 | 2310131130330313023312 |
5 | 3111140003242321402 |
6 | 42213000035003450 |
7 | 2416644364061634 |
oct | 264353474671366 |
9 | 47815432016113 |
10 | 12401130042102 |
11 | 3a5132068059a |
12 | 1483509439586 |
13 | 6bc563199a99 |
14 | 30c309ca0354 |
15 | 1678adb3656c |
hex | b475cf372f6 |
12401130042102 has 8 divisors (see below), whose sum is σ = 24802260084216. Its totient is φ = 4133710014032.
The previous prime is 12401130042043. The next prime is 12401130042109. The reversal of 12401130042102 is 20124003110421.
It is a sphenic number, since it is the product of 3 distinct primes.
12401130042102 is an admirable number.
It is a super-2 number, since 2×124011300421022 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12401130042109) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1033427503503 + ... + 1033427503514.
It is an arithmetic number, because the mean of its divisors is an integer number (3100282510527).
Almost surely, 212401130042102 is an apocalyptic number.
12401130042102 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12401130042102 is a wasteful number, since it uses less digits than its factorization.
12401130042102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2066855007022.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 12401130042102 its reverse (20124003110421), we get a palindrome (32525133152523).
The spelling of 12401130042102 in words is "twelve trillion, four hundred one billion, one hundred thirty million, forty-two thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •