Base | Representation |
---|---|
bin | 11011110101010110001100… |
… | …101000110100001111001000 |
3 | 121001102120220221111102222211 |
4 | 123311112030220310033020 |
5 | 112021104234414211011 |
6 | 1112203505200154504 |
7 | 34533030524225065 |
oct | 3365261450641710 |
9 | 531376827442884 |
10 | 122413222413256 |
11 | 36006179823155 |
12 | 11890604608a34 |
13 | 533c6957a5038 |
14 | 2232b8dbc5c6c |
15 | e243aec63b21 |
hex | 6f558ca343c8 |
122413222413256 has 16 divisors (see below), whose sum is σ = 229525834987440. Its totient is φ = 61206333083280.
The previous prime is 122413222413239. The next prime is 122413222413257. The reversal of 122413222413256 is 652314222314221.
It is a super-2 number, since 2×1224132224132562 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (122413222413257) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 32888866 + ... + 36421201.
It is an arithmetic number, because the mean of its divisors is an integer number (14345364686715).
Almost surely, 2122413222413256 is an apocalyptic number.
It is an amenable number.
122413222413256 is a deficient number, since it is larger than the sum of its proper divisors (107112612574184).
122413222413256 is a wasteful number, since it uses less digits than its factorization.
122413222413256 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69530844 (or 69530840 counting only the distinct ones).
The product of its digits is 276480, while the sum is 40.
Adding to 122413222413256 its reverse (652314222314221), we get a palindrome (774727444727477).
The spelling of 122413222413256 in words is "one hundred twenty-two trillion, four hundred thirteen billion, two hundred twenty-two million, four hundred thirteen thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •