Base | Representation |
---|---|
bin | 11011010010011000000010… |
… | …000100110110010001001010 |
3 | 120201220211211000021001010010 |
4 | 123102120002010312101022 |
5 | 111212221000304310442 |
6 | 1103123500555332350 |
7 | 34164302643313452 |
oct | 3322300204662112 |
9 | 521824730231103 |
10 | 120010011010122 |
11 | 35269a616192a2 |
12 | 115628b1a510b6 |
13 | 51c6b844a06bc |
14 | 218c73085ad62 |
15 | dd1b0848ab9c |
hex | 6d260213644a |
120010011010122 has 8 divisors (see below), whose sum is σ = 240020022020256. Its totient is φ = 40003337003372.
The previous prime is 120010011010121. The next prime is 120010011010177. The reversal of 120010011010122 is 221010110010021.
It is a sphenic number, since it is the product of 3 distinct primes.
120010011010122 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 120010011010098 and 120010011010107.
It is not an unprimeable number, because it can be changed into a prime (120010011010121) 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, 10000834250838 + ... + 10000834250849.
It is an arithmetic number, because the mean of its divisors is an integer number (30002502752532).
Almost surely, 2120010011010122 is an apocalyptic number.
120010011010122 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120010011010122 is a wasteful number, since it uses less digits than its factorization.
120010011010122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20001668501692.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 120010011010122 its reverse (221010110010021), we get a palindrome (341020121020143).
The spelling of 120010011010122 in words is "one hundred twenty trillion, ten billion, eleven million, ten thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •