Base | Representation |
---|---|
bin | 1001001001111011100100… |
… | …10101101101111100111110 |
3 | 2122021122022122220011101020 |
4 | 10210331302111231330332 |
5 | 10114322204040342342 |
6 | 110452413300525010 |
7 | 4145343245401653 |
oct | 444756225557476 |
9 | 78248278804336 |
10 | 20132430012222 |
11 | 646212a988330 |
12 | 23119720b0766 |
13 | b30631751908 |
14 | 4d85b4359c2a |
15 | 24da561ed0ec |
hex | 124f7256df3e |
20132430012222 has 16 divisors (see below), whose sum is σ = 43925301844992. Its totient is φ = 6100736367320.
The previous prime is 20132430012203. The next prime is 20132430012223. The reversal of 20132430012222 is 22221003423102.
It is a junction number, because it is equal to n+sod(n) for n = 20132430012192 and 20132430012201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20132430012223) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 152518409118 + ... + 152518409249.
It is an arithmetic number, because the mean of its divisors is an integer number (2745331365312).
Almost surely, 220132430012222 is an apocalyptic number.
20132430012222 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
20132430012222 is an abundant number, since it is smaller than the sum of its proper divisors (23792871832770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20132430012222 is a wasteful number, since it uses less digits than its factorization.
20132430012222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 305036818383.
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 20132430012222 its reverse (22221003423102), we get a palindrome (42353433435324).
The spelling of 20132430012222 in words is "twenty trillion, one hundred thirty-two billion, four hundred thirty million, twelve thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •