Base | Representation |
---|---|
bin | 11011100011101110001010… |
… | …001101110011011010100100 |
3 | 120220010210112211201111000201 |
4 | 123203232022031303122210 |
5 | 111341233144224000400 |
6 | 1105435233001520244 |
7 | 34346361400125556 |
oct | 3343561215633244 |
9 | 526123484644021 |
10 | 121202001000100 |
11 | 35689530920299 |
12 | 11715914aa3084 |
13 | 52823b844bcb7 |
14 | 21d02cb2334d6 |
15 | e02b1ed5006a |
hex | 6e3b8a3736a4 |
121202001000100 has 18 divisors (see below), whose sum is σ = 263008342170434. Its totient is φ = 48480800400000.
The previous prime is 121202000999999. The next prime is 121202001000121. The reversal of 121202001000100 is 1000100202121.
It can be written as a sum of positive squares in 3 ways, for example, as 169394803776 + 121032606196324 = 411576^2 + 11001482^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 606010004901 + ... + 606010005100.
Almost surely, 2121202001000100 is an apocalyptic number.
121202001000100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121202001000100 is an abundant number, since it is smaller than the sum of its proper divisors (141806341170334).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121202001000100 is a wasteful number, since it uses less digits than its factorization.
121202001000100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1212020010015 (or 1212020010008 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 121202001000100 its reverse (1000100202121), we get a palindrome (122202101202221).
The spelling of 121202001000100 in words is "one hundred twenty-one trillion, two hundred two billion, one million, one hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •