Base | Representation |
---|---|
bin | 11011100010011010010110… |
… | …111011111101001010001010 |
3 | 120212211012021220210202111220 |
4 | 123202122112323331022022 |
5 | 111333244404122041020 |
6 | 1105330032143102510 |
7 | 34340024522162064 |
oct | 3342322673751212 |
9 | 525735256722456 |
10 | 121112020112010 |
11 | 35654356a73274 |
12 | 117003a25a1a36 |
13 | 5276a7858bb55 |
14 | 21c9bd2aac734 |
15 | e006054eb240 |
hex | 6e2696efd28a |
121112020112010 has 64 divisors (see below), whose sum is σ = 306141265815552. Its totient is φ = 30603627872576.
The previous prime is 121112020112003. The next prime is 121112020112047. The reversal of 121112020112010 is 10211020211121.
It is a happy number.
It is a super-2 number, since 2×1211120201120102 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 820134894 + ... + 820282553.
It is an arithmetic number, because the mean of its divisors is an integer number (4783457278368).
Almost surely, 2121112020112010 is an apocalyptic number.
121112020112010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
121112020112010 is an abundant number, since it is smaller than the sum of its proper divisors (185029245703542).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121112020112010 is a wasteful number, since it uses less digits than its factorization.
121112020112010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1640417587.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 121112020112010 its reverse (10211020211121), we get a palindrome (131323040323131).
The spelling of 121112020112010 in words is "one hundred twenty-one trillion, one hundred twelve billion, twenty million, one hundred twelve thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •