Base | Representation |
---|---|
bin | 11110110111010110000… |
… | …110111001110110111000 |
3 | 21111202200220102010211101 |
4 | 132313112012321312320 |
5 | 234222312304323000 |
6 | 4302213510541144 |
7 | 306144426061300 |
oct | 36672606716670 |
9 | 7452626363741 |
10 | 2121011011000 |
11 | 74857446a492 |
12 | 2a30963677b4 |
13 | 12501a0426ab |
14 | 7492c1ac600 |
15 | 3a28badbe6a |
hex | 1edd61b9db8 |
2121011011000 has 192 divisors, whose sum is σ = 5778122968800. Its totient is φ = 726618816000.
The previous prime is 2121011010973. The next prime is 2121011011037. The reversal of 2121011011000 is 1101101212.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 63242236 + ... + 63275764.
Almost surely, 22121011011000 is an apocalyptic number.
2121011011000 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 2121011011000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2889061484400).
2121011011000 is an abundant number, since it is smaller than the sum of its proper divisors (3657111957800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2121011011000 is a wasteful number, since it uses less digits than its factorization.
2121011011000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34855 (or 34834 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 2121011011000 its reverse (1101101212), we get a palindrome (2122112112212).
The spelling of 2121011011000 in words is "two trillion, one hundred twenty-one billion, eleven million, eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •