Base | Representation |
---|---|
bin | 11101010001010010000… |
… | …110000000110100000000 |
3 | 21010021211110100200201012 |
4 | 131101102012000310000 |
5 | 230423343013034212 |
6 | 4140011242100052 |
7 | 265214624631503 |
oct | 35212206006400 |
9 | 7107743320635 |
10 | 2011422002432 |
11 | 706048312317 |
12 | 2859b11aa628 |
13 | 1178a3a34cab |
14 | 6d4d381113a |
15 | 374c5b29922 |
hex | 1d452180d00 |
2011422002432 has 36 divisors (see below), whose sum is σ = 4043871756960. Its totient is φ = 998475652608.
The previous prime is 2011422002411. The next prime is 2011422002437. The reversal of 2011422002432 is 2342002241102.
It is a super-2 number, since 2×20114220024322 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2011422002398 and 2011422002407.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2011422002437) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 28227428 + ... + 28298595.
Almost surely, 22011422002432 is an apocalyptic number.
It is an amenable number.
2011422002432 is an abundant number, since it is smaller than the sum of its proper divisors (2032449754528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2011422002432 is an equidigital number, since it uses as much as digits as its factorization.
2011422002432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56526178 (or 56526164 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 23.
Adding to 2011422002432 its reverse (2342002241102), we get a palindrome (4353424243534).
The spelling of 2011422002432 in words is "two trillion, eleven billion, four hundred twenty-two million, two thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •