Base | Representation |
---|---|
bin | 11101100011111001100… |
… | …111011010010101110000 |
3 | 21012012102121212020002010 |
4 | 131203321213122111300 |
5 | 231240313040001000 |
6 | 4153115030122520 |
7 | 266523202454223 |
oct | 35437147322560 |
9 | 7165377766063 |
10 | 2031412422000 |
11 | 713576398425 |
12 | 28984bab0440 |
13 | 11973b437020 |
14 | 7046c7215ba |
15 | 37c95b01d50 |
hex | 1d8f99da570 |
2031412422000 has 320 divisors, whose sum is σ = 7057014322176. Its totient is φ = 499759948800.
The previous prime is 2031412421993. The next prime is 2031412422023. The reversal of 2031412422000 is 2242141302.
It is a congruent number.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 162467749 + ... + 162480251.
Almost surely, 22031412422000 is an apocalyptic number.
2031412422000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2031412422000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3528507161088).
2031412422000 is an abundant number, since it is smaller than the sum of its proper divisors (5025601900176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2031412422000 is a wasteful number, since it uses less digits than its factorization.
2031412422000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14625 (or 14609 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 2031412422000 its reverse (2242141302), we get a palindrome (2033654563302).
The spelling of 2031412422000 in words is "two trillion, thirty-one billion, four hundred twelve million, four hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •