Base | Representation |
---|---|
bin | 1001001010001011111111… |
… | …01010001111010010000110 |
3 | 2122022111001212220011201201 |
4 | 10211011333222033102012 |
5 | 10114443231304230042 |
6 | 110500432015013114 |
7 | 4146104534251411 |
oct | 445057752172206 |
9 | 78274055804651 |
10 | 20141243430022 |
11 | 64659429205a0 |
12 | 231361180a19a |
13 | b31407665030 |
14 | 4d8baca82b78 |
15 | 24ddbed211b7 |
hex | 12517fa8f486 |
20141243430022 has 64 divisors (see below), whose sum is σ = 36719552136960. Its totient is φ = 8159023555200.
The previous prime is 20141243429953. The next prime is 20141243430029. The reversal of 20141243430022 is 22003434214102.
It is a super-2 number, since 2×201412434300222 (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 (20141243430029) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 186419997 + ... + 186528007.
It is an arithmetic number, because the mean of its divisors is an integer number (573743002140).
Almost surely, 220141243430022 is an apocalyptic number.
20141243430022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
20141243430022 is a deficient number, since it is larger than the sum of its proper divisors (16578308706938).
20141243430022 is a wasteful number, since it uses less digits than its factorization.
20141243430022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130549.
The product of its (nonzero) digits is 9216, while the sum is 28.
Adding to 20141243430022 its reverse (22003434214102), we get a palindrome (42144677644124).
The spelling of 20141243430022 in words is "twenty trillion, one hundred forty-one billion, two hundred forty-three million, four hundred thirty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •