Base | Representation |
---|---|
bin | 10110111111001100101110… |
… | …010100000110010011110000 |
3 | 111020222001210200100011220202 |
4 | 112333030232110012103300 |
5 | 101222410311110414300 |
6 | 555004412053454332 |
7 | 30203143356444635 |
oct | 2677145624062360 |
9 | 436861720304822 |
10 | 101100012201200 |
11 | 2a239302241101 |
12 | b409a396413a8 |
13 | 44548c860395c |
14 | 1ad73a3b7418c |
15 | ba4c9b380ad5 |
hex | 5bf32e5064f0 |
101100012201200 has 240 divisors, whose sum is σ = 257647350055872. Its totient is φ = 38041850880000.
The previous prime is 101100012201191. The next prime is 101100012201211. The reversal of 101100012201200 is 2102210001101.
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, 6263545130 + ... + 6263561270.
Almost surely, 2101100012201200 is an apocalyptic number.
101100012201200 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 101100012201200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (128823675027936).
101100012201200 is an abundant number, since it is smaller than the sum of its proper divisors (156547337854672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101100012201200 is a wasteful number, since it uses less digits than its factorization.
101100012201200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27404 (or 27393 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 101100012201200 its reverse (2102210001101), we get a palindrome (103202222202301).
The spelling of 101100012201200 in words is "one hundred one trillion, one hundred billion, twelve million, two hundred one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •