Base | Representation |
---|---|
bin | 10111001101111010010011… |
… | …110111001001001000110000 |
3 | 111101112201102110201102012222 |
4 | 113031322103313021020300 |
5 | 101340441343444414300 |
6 | 1001101054442340212 |
7 | 30336164410242212 |
oct | 2715722367111060 |
9 | 441481373642188 |
10 | 102111033201200 |
11 | 2a599056238461 |
12 | b5519764ba668 |
13 | 44c904bc6a46a |
14 | 1b302b3b965b2 |
15 | bc1220433785 |
hex | 5cde93dc9230 |
102111033201200 has 120 divisors (see below), whose sum is σ = 246373979972736. Its totient is φ = 40669272576000.
The previous prime is 102111033201193. The next prime is 102111033201227. The reversal of 102111033201200 is 2102330111201.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 729967265 + ... + 730107135.
Almost surely, 2102111033201200 is an apocalyptic number.
102111033201200 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 102111033201200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (123186989986368).
102111033201200 is an abundant number, since it is smaller than the sum of its proper divisors (144262946771536).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102111033201200 is a wasteful number, since it uses less digits than its factorization.
102111033201200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 147703 (or 147692 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 102111033201200 its reverse (2102330111201), we get a palindrome (104213363312401).
The spelling of 102111033201200 in words is "one hundred two trillion, one hundred eleven billion, thirty-three million, two hundred one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •