Base | Representation |
---|---|
bin | 11011100010010001000010… |
… | …011010000111110101010100 |
3 | 120212210020110102211010010020 |
4 | 123202101002122013311110 |
5 | 111333113410034201400 |
6 | 1105321255111025140 |
7 | 34336221515624304 |
oct | 3342210232076524 |
9 | 525706412733106 |
10 | 121102012022100 |
11 | 3565009073318a |
12 | 116ba46a96b1b0 |
13 | 5275b41ccb365 |
14 | 21c9523841604 |
15 | e0021ba912a0 |
hex | 6e2442687d54 |
121102012022100 has 36 divisors (see below), whose sum is σ = 350388488118144. Its totient is φ = 32293869872480.
The previous prime is 121102012022093. The next prime is 121102012022111. The reversal of 121102012022100 is 1220210201121.
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 121102012022100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 201836686404 + ... + 201836687003.
Almost surely, 2121102012022100 is an apocalyptic number.
121102012022100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121102012022100 is an abundant number, since it is smaller than the sum of its proper divisors (229286476096044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121102012022100 is a wasteful number, since it uses less digits than its factorization.
121102012022100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 403673373424 (or 403673373417 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 121102012022100 its reverse (1220210201121), we get a palindrome (122322222223221).
The spelling of 121102012022100 in words is "one hundred twenty-one trillion, one hundred two billion, twelve million, twenty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •