Base | Representation |
---|---|
bin | 11101101100001100101… |
… | …110101100110000001000 |
3 | 21020001102121202012222020 |
4 | 131230030232230300020 |
5 | 231412040144042440 |
6 | 4201151135324440 |
7 | 300260051432220 |
oct | 35541456546010 |
9 | 7201377665866 |
10 | 2040323034120 |
11 | 717329186178 |
12 | 28b518080720 |
13 | 11a52b51ab87 |
14 | 70a75d09080 |
15 | 381180233d0 |
hex | 1db0cbacc08 |
2040323034120 has 64 divisors (see below), whose sum is σ = 6995393262720. Its totient is φ = 466359550464.
The previous prime is 2040323034109. The next prime is 2040323034199. The reversal of 2040323034120 is 214303230402.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 1214477157 + ... + 1214478836.
It is an arithmetic number, because the mean of its divisors is an integer number (109303019730).
Almost surely, 22040323034120 is an apocalyptic number.
2040323034120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2040323034120 is an abundant number, since it is smaller than the sum of its proper divisors (4955070228600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2040323034120 is a wasteful number, since it uses less digits than its factorization.
2040323034120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2428956014 (or 2428956010 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 24.
Adding to 2040323034120 its reverse (214303230402), we get a palindrome (2254626264522).
The spelling of 2040323034120 in words is "two trillion, forty billion, three hundred twenty-three million, thirty-four thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •