Base | Representation |
---|---|
bin | 1011000001100010101010… |
… | …0001011010100110100100 |
3 | 1120220202201002000001112220 |
4 | 2300120222201122212210 |
5 | 3042043013421041400 |
6 | 41440210033312340 |
7 | 2360502301331544 |
oct | 260305241324644 |
9 | 46822632001486 |
10 | 12121111112100 |
11 | 3953597253991 |
12 | 143919b7056b0 |
13 | 69c028b48723 |
14 | 2dc944717324 |
15 | 1604707047a0 |
hex | b062a85a9a4 |
12121111112100 has 72 divisors (see below), whose sum is σ = 35070822302880. Its totient is φ = 3232258740480.
The previous prime is 12121111112023. The next prime is 12121111112101. The reversal of 12121111112100 is 121111112121.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 12121111112100.
It is not an unprimeable number, because it can be changed into a prime (12121111112101) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 33875931 + ... + 34231869.
Almost surely, 212121111112100 is an apocalyptic number.
12121111112100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12121111112100 is an abundant number, since it is smaller than the sum of its proper divisors (22949711190780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12121111112100 is a wasteful number, since it uses less digits than its factorization.
12121111112100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 469469 (or 469462 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 12121111112100 its reverse (121111112121), we get a palindrome (12242222224221).
The spelling of 12121111112100 in words is "twelve trillion, one hundred twenty-one billion, one hundred eleven million, one hundred twelve thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •