Base | Representation |
---|---|
bin | 11011110010100100001110… |
… | …000011000000101000001101 |
3 | 121000202022122200121121210210 |
4 | 123302210032003000220031 |
5 | 112004441400210343201 |
6 | 1111540022232353033 |
7 | 34513154033510061 |
oct | 3362441603005015 |
9 | 530668580547723 |
10 | 122222120012301 |
11 | 35a421234718a1 |
12 | 1185b570845779 |
13 | 532765b96188a |
14 | 22278216a1aa1 |
15 | e1e4279e01d6 |
hex | 6f290e0c0a0d |
122222120012301 has 16 divisors (see below), whose sum is σ = 171259488513344. Its totient is φ = 77435510350464.
The previous prime is 122222120012299. The next prime is 122222120012329. The reversal of 122222120012301 is 103210021222221.
It is not a de Polignac number, because 122222120012301 - 21 = 122222120012299 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122222120012371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12803485696 + ... + 12803495241.
It is an arithmetic number, because the mean of its divisors is an integer number (10703718032084).
Almost surely, 2122222120012301 is an apocalyptic number.
It is an amenable number.
122222120012301 is a deficient number, since it is larger than the sum of its proper divisors (49037368501043).
122222120012301 is a wasteful number, since it uses less digits than its factorization.
122222120012301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25606981020.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 122222120012301 its reverse (103210021222221), we get a palindrome (225432141234522).
The spelling of 122222120012301 in words is "one hundred twenty-two trillion, two hundred twenty-two billion, one hundred twenty million, twelve thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •