Base | Representation |
---|---|
bin | 10001011101110010010… |
… | …001110000011011001000 |
3 | 11020201221220202101111021 |
4 | 101131302101300123020 |
5 | 124131014030224000 |
6 | 2315211552442224 |
7 | 152466254206030 |
oct | 21356221603310 |
9 | 4221856671437 |
10 | 1200213133000 |
11 | 42300a02a072 |
12 | 174738b49374 |
13 | 892447bc8cb |
14 | 4213a9688c0 |
15 | 2134878b11a |
hex | 117724706c8 |
1200213133000 has 128 divisors (see below), whose sum is σ = 3212347507200. Its totient is φ = 411163872000.
The previous prime is 1200213132973. The next prime is 1200213133039. The reversal of 1200213133000 is 3313120021.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8533245 + ... + 8672755.
It is an arithmetic number, because the mean of its divisors is an integer number (25096464900).
Almost surely, 21200213133000 is an apocalyptic number.
1200213133000 is a gapful number since it is divisible by the number (10) 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 1200213133000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1606173753600).
1200213133000 is an abundant number, since it is smaller than the sum of its proper divisors (2012134374200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1200213133000 is a wasteful number, since it uses less digits than its factorization.
1200213133000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 140768 (or 140754 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 1200213133000 its reverse (3313120021), we get a palindrome (1203526253021).
The spelling of 1200213133000 in words is "one trillion, two hundred billion, two hundred thirteen million, one hundred thirty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •