Base | Representation |
---|---|
bin | 11101000110111010000… |
… | …00001010101100010000 |
3 | 10112121112111021101210211 |
4 | 32203131000022230100 |
5 | 112341241344034300 |
6 | 2043242535533504 |
7 | 132154256420131 |
oct | 16433500125420 |
9 | 3477474241724 |
10 | 1000140221200 |
11 | 35618009918a |
12 | 141a00b2a294 |
13 | 7340b352773 |
14 | 3659ad07c88 |
15 | 1b038c134ba |
hex | e8dd00ab10 |
1000140221200 has 180 divisors, whose sum is σ = 2449230739200. Its totient is φ = 392463202560.
The previous prime is 1000140221153. The next prime is 1000140221221. The reversal of 1000140221200 is 21220410001.
It is a happy number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 416897601 + ... + 416899999.
It is an arithmetic number, because the mean of its divisors is an integer number (13606837440).
Almost surely, 21000140221200 is an apocalyptic number.
1000140221200 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 1000140221200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1224615369600).
1000140221200 is an abundant number, since it is smaller than the sum of its proper divisors (1449090518000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1000140221200 is a wasteful number, since it uses less digits than its factorization.
1000140221200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2742 (or 2652 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 1000140221200 its reverse (21220410001), we get a palindrome (1021360631201).
The spelling of 1000140221200 in words is "one trillion, one hundred forty million, two hundred twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •