Base | Representation |
---|---|
bin | 11011110011111111100101… |
… | …010000110100001010010001 |
3 | 121001002200212110002000021110 |
4 | 123303333211100310022101 |
5 | 112013043302310410301 |
6 | 1112053044444043533 |
7 | 34523226036661440 |
oct | 3363774520641221 |
9 | 531080773060243 |
10 | 122320220013201 |
11 | 35a7a794352501 |
12 | 1187658a2335a9 |
13 | 533399393aca2 |
14 | 222c48a258d57 |
15 | e21c6a01c0d6 |
hex | 6f3fe5434291 |
122320220013201 has 32 divisors (see below), whose sum is σ = 187591292080128. Its totient is φ = 69448054440960.
The previous prime is 122320220013169. The next prime is 122320220013223. The reversal of 122320220013201 is 102310022023221.
It is not a de Polignac number, because 122320220013201 - 25 = 122320220013169 is a prime.
It is a super-2 number, since 2×1223202200132012 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (122320220013601) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6417841 + ... + 16906481.
It is an arithmetic number, because the mean of its divisors is an integer number (5862227877504).
Almost surely, 2122320220013201 is an apocalyptic number.
It is an amenable number.
122320220013201 is a deficient number, since it is larger than the sum of its proper divisors (65271072066927).
122320220013201 is a wasteful number, since it uses less digits than its factorization.
122320220013201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10492221.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 122320220013201 its reverse (102310022023221), we get a palindrome (224630242036422).
The spelling of 122320220013201 in words is "one hundred twenty-two trillion, three hundred twenty billion, two hundred twenty million, thirteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.137 sec. • engine limits •