Base | Representation |
---|---|
bin | 11011101111010111010100… |
… | …011011011101101001110110 |
3 | 120222222021202210222121020221 |
4 | 123233113110123131221312 |
5 | 111442340310130341042 |
6 | 1111250555014444554 |
7 | 34461235006405612 |
oct | 3357272433355166 |
9 | 528867683877227 |
10 | 122002110012022 |
11 | 35967893571289 |
12 | 118249ab96375a |
13 | 530c998b76066 |
14 | 221ad0dc54342 |
15 | e1884c9c6d67 |
hex | 6ef5d46dda76 |
122002110012022 has 8 divisors (see below), whose sum is σ = 183018280538376. Its totient is φ = 60996016499232.
The previous prime is 122002110011993. The next prime is 122002110012023. The reversal of 122002110012022 is 220210011200221.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×1220021100120223 (a number of 43 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 122002110011987 and 122002110012005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122002110012023) 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, 2519223123 + ... + 2519271550.
It is an arithmetic number, because the mean of its divisors is an integer number (22877285067297).
Almost surely, 2122002110012022 is an apocalyptic number.
122002110012022 is a deficient number, since it is larger than the sum of its proper divisors (61016170526354).
122002110012022 is a wasteful number, since it uses less digits than its factorization.
122002110012022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5038506782.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 122002110012022 its reverse (220210011200221), we get a palindrome (342212121212243).
The spelling of 122002110012022 in words is "one hundred twenty-two trillion, two billion, one hundred ten million, twelve thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •