Base | Representation |
---|---|
bin | 11011100001000101100101… |
… | …110010010111100101011100 |
3 | 120212111111100122200001122020 |
4 | 123201011211302113211130 |
5 | 111330302002301431022 |
6 | 1105220140324020140 |
7 | 34330323141205332 |
oct | 3341054562274534 |
9 | 525444318601566 |
10 | 121021001202012 |
11 | 3561979a192aaa |
12 | 116a6820531650 |
13 | 526b30163b462 |
14 | 21c563a73db52 |
15 | ded0799a535c |
hex | 6e1165c9795c |
121021001202012 has 24 divisors (see below), whose sum is σ = 282389105980800. Its totient is φ = 40339366613616.
The previous prime is 121021001201987. The next prime is 121021001202161. The reversal of 121021001202012 is 210202100120121.
It is a junction number, because it is equal to n+sod(n) for n = 121021001201982 and 121021001202000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 120368562 + ... + 121369817.
It is an arithmetic number, because the mean of its divisors is an integer number (11766212749200).
Almost surely, 2121021001202012 is an apocalyptic number.
121021001202012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
121021001202012 is an abundant number, since it is smaller than the sum of its proper divisors (161368104778788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121021001202012 is a wasteful number, since it uses less digits than its factorization.
121021001202012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 241780105 (or 241780103 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 121021001202012 its reverse (210202100120121), we get a palindrome (331223101322133).
The spelling of 121021001202012 in words is "one hundred twenty-one trillion, twenty-one billion, one million, two hundred two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •