Base | Representation |
---|---|
bin | 11011100010100001110011… |
… | …110001100100001000100100 |
3 | 120212211221221110020021111211 |
4 | 123202201303301210020210 |
5 | 111333412300122320400 |
6 | 1105333434043041204 |
7 | 34340430003134611 |
oct | 3342416361441044 |
9 | 525757843207454 |
10 | 121120020120100 |
11 | 35657791846801 |
12 | 11701a55810204 |
13 | 5277751b05851 |
14 | 21ca351379508 |
15 | e009229e8dba |
hex | 6e2873c64224 |
121120020120100 has 72 divisors (see below), whose sum is σ = 270131156480360. Its totient is φ = 47138600453760.
The previous prime is 121120020120059. The next prime is 121120020120103. The reversal of 121120020120100 is 1021020021121.
It can be written as a sum of positive squares in 12 ways, for example, as 9975629530084 + 111144390590016 = 3158422^2 + 10542504^2 .
It is not an unprimeable number, because it can be changed into a prime (121120020120103) 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, 6890559 + ... + 17021158.
Almost surely, 2121120020120100 is an apocalyptic number.
121120020120100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121120020120100 is an abundant number, since it is smaller than the sum of its proper divisors (149011136360260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121120020120100 is an equidigital number, since it uses as much as digits as its factorization.
121120020120100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23911842 (or 23911761 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 121120020120100 its reverse (1021020021121), we get a palindrome (122141040141221).
The spelling of 121120020120100 in words is "one hundred twenty-one trillion, one hundred twenty billion, twenty million, one hundred twenty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •