Base | Representation |
---|---|
bin | 101111001011010101… |
… | …1011000000110001100 |
3 | 100200111121210001202110 |
4 | 1132112223120012030 |
5 | 3124441410413400 |
6 | 114313040024020 |
7 | 10214416333455 |
oct | 1362653300614 |
9 | 320447701673 |
10 | 101312201100 |
11 | 39a6a107220 |
12 | 17775302010 |
13 | 972762a0b6 |
14 | 4c9143a12c |
15 | 297e539e50 |
hex | 1796ad818c |
101312201100 has 288 divisors, whose sum is σ = 330501346560. Its totient is φ = 23748480000.
The previous prime is 101312201099. The next prime is 101312201119. The reversal of 101312201100 is 1102213101.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 14328366 + ... + 14335434.
It is an arithmetic number, because the mean of its divisors is an integer number (1147574120).
Almost surely, 2101312201100 is an apocalyptic number.
101312201100 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 101312201100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (165250673280).
101312201100 is an abundant number, since it is smaller than the sum of its proper divisors (229189145460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101312201100 is a wasteful number, since it uses less digits than its factorization.
101312201100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7241 (or 7234 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 101312201100 its reverse (1102213101), we get a palindrome (102414414201).
The spelling of 101312201100 in words is "one hundred one billion, three hundred twelve million, two hundred one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •