Base | Representation |
---|---|
bin | 11011100001000101110010… |
… | …001111101001000001101010 |
3 | 120212111111220012221101000121 |
4 | 123201011302033221001222 |
5 | 111330302414302432333 |
6 | 1105220213151353454 |
7 | 34330331256526354 |
oct | 3341056217510152 |
9 | 525444805841017 |
10 | 121021210202218 |
11 | 35619897162a47 |
12 | 116a687a52288a |
13 | 526b335a27211 |
14 | 21c565a3c60d4 |
15 | ded08cedb32d |
hex | 6e11723e906a |
121021210202218 has 8 divisors (see below), whose sum is σ = 182917554351840. Its totient is φ = 60048692084940.
The previous prime is 121021210202147. The next prime is 121021210202219. The reversal of 121021210202218 is 812202012120121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1210212102022182 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 121021210202192 and 121021210202201.
It is not an unprimeable number, because it can be changed into a prime (121021210202219) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 230956507758 + ... + 230956508281.
It is an arithmetic number, because the mean of its divisors is an integer number (22864694293980).
Almost surely, 2121021210202218 is an apocalyptic number.
121021210202218 is a deficient number, since it is larger than the sum of its proper divisors (61896344149622).
121021210202218 is a wasteful number, since it uses less digits than its factorization.
121021210202218 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 461913016172.
The product of its (nonzero) digits is 512, while the sum is 25.
Adding to 121021210202218 its reverse (812202012120121), we get a palindrome (933223222322339).
The spelling of 121021210202218 in words is "one hundred twenty-one trillion, twenty-one billion, two hundred ten million, two hundred two thousand, two hundred eighteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •