Base | Representation |
---|---|
bin | 11011101111101010111101… |
… | …100000001001101010111111 |
3 | 121000001022012121220020012022 |
4 | 123233222331200021222333 |
5 | 111443212003222421112 |
6 | 1111304403450430355 |
7 | 34462612440145331 |
oct | 3357527540115277 |
9 | 530038177806168 |
10 | 122023200201407 |
11 | 3597582641476a |
12 | 11828ab6a323bb |
13 | 531197a37806b |
14 | 221bd50c43451 |
15 | e191842dbd72 |
hex | 6efabd809abf |
122023200201407 has 2 divisors, whose sum is σ = 122023200201408. Its totient is φ = 122023200201406.
The previous prime is 122023200201277. The next prime is 122023200201499. The reversal of 122023200201407 is 704102002320221.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 122023200201407 - 222 = 122023196007103 is a prime.
It is a super-2 number, since 2×1220232002014072 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122023200201907) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61011600100703 + 61011600100704.
It is an arithmetic number, because the mean of its divisors is an integer number (61011600100704).
Almost surely, 2122023200201407 is an apocalyptic number.
122023200201407 is a deficient number, since it is larger than the sum of its proper divisors (1).
122023200201407 is an equidigital number, since it uses as much as digits as its factorization.
122023200201407 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2688, while the sum is 26.
Adding to 122023200201407 its reverse (704102002320221), we get a palindrome (826125202521628).
The spelling of 122023200201407 in words is "one hundred twenty-two trillion, twenty-three billion, two hundred million, two hundred one thousand, four hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •