Base | Representation |
---|---|
bin | 11011100000110010111110… |
… | …111100100001110010110100 |
3 | 120212102120210021122122121020 |
4 | 123200302332330201302310 |
5 | 111324440043140413022 |
6 | 1105203034024421140 |
7 | 34326015062411112 |
oct | 3340627674416264 |
9 | 525376707578536 |
10 | 121001022201012 |
11 | 356112775a6928 |
12 | 116a29856177b0 |
13 | 5269469406885 |
14 | 21c46a3162ab2 |
15 | dec7aa9d635c |
hex | 6e0cbef21cb4 |
121001022201012 has 36 divisors (see below), whose sum is σ = 287202177375456. Its totient is φ = 39650052458960.
The previous prime is 121001022201011. The next prime is 121001022201029. The reversal of 121001022201012 is 210102220100121.
It is a junction number, because it is equal to n+sod(n) for n = 121001022200982 and 121001022201000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121001022201011) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1448309064 + ... + 1448392607.
Almost surely, 2121001022201012 is an apocalyptic number.
121001022201012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
121001022201012 is an abundant number, since it is smaller than the sum of its proper divisors (166201155174444).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121001022201012 is a wasteful number, since it uses less digits than its factorization.
121001022201012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2896701796 (or 2896701735 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 121001022201012 its reverse (210102220100121), we get a palindrome (331103242301133).
The spelling of 121001022201012 in words is "one hundred twenty-one trillion, one billion, twenty-two million, two hundred one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •