Base | Representation |
---|---|
bin | 11011100000111011010110… |
… | …101110111010111111111100 |
3 | 120212110102222202002020020221 |
4 | 123200323112232322333330 |
5 | 111330112000333101022 |
6 | 1105211122014351124 |
7 | 34326453613004323 |
oct | 3340732656727774 |
9 | 525412882066227 |
10 | 121010011222012 |
11 | 3561506a679400 |
12 | 116a4673abb4a4 |
13 | 526a26c811803 |
14 | 21c4cb6d1b0ba |
15 | decb34c44cc7 |
hex | 6e0ed6bbaffc |
121010011222012 has 36 divisors (see below), whose sum is σ = 246461566382640. Its totient is φ = 51768988754560.
The previous prime is 121010011222003. The next prime is 121010011222013. The reversal of 121010011222012 is 210222110010121.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121010011222013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7353541312 + ... + 7353557767.
It is an arithmetic number, because the mean of its divisors is an integer number (6846154621740).
Almost surely, 2121010011222012 is an apocalyptic number.
It is an amenable number.
121010011222012 is an abundant number, since it is smaller than the sum of its proper divisors (125451555160628).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121010011222012 is a wasteful number, since it uses less digits than its factorization.
121010011222012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14707099122 (or 14707099109 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 121010011222012 its reverse (210222110010121), we get a palindrome (331232121232133).
The spelling of 121010011222012 in words is "one hundred twenty-one trillion, ten billion, eleven million, two hundred twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •