Base | Representation |
---|---|
bin | 111000111101011010… |
… | …1111011100000010001 |
3 | 102200201200201221210222 |
4 | 1301322311323200101 |
5 | 4001002412321001 |
6 | 132105411002425 |
7 | 11560130126153 |
oct | 1617265734021 |
9 | 380650657728 |
10 | 122320042001 |
11 | 4796a525003 |
12 | 1b858899415 |
13 | b6c4a58aa1 |
14 | 5cc5510ad3 |
15 | 32ad9d561b |
hex | 1c7ad7b811 |
122320042001 has 4 divisors (see below), whose sum is σ = 122326334004. Its totient is φ = 122313750000.
The previous prime is 122320041973. The next prime is 122320042027. The reversal of 122320042001 is 100240023221.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 100240023221 = 13 ⋅7710771017.
It can be written as a sum of positive squares in 2 ways, for example, as 80272488976 + 42047553025 = 283324^2 + 205055^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122320042001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (122320047001) 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, 3116750 + ... + 3155751.
It is an arithmetic number, because the mean of its divisors is an integer number (30581583501).
Almost surely, 2122320042001 is an apocalyptic number.
It is an amenable number.
122320042001 is a deficient number, since it is larger than the sum of its proper divisors (6292003).
122320042001 is an equidigital number, since it uses as much as digits as its factorization.
122320042001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6292002.
The product of its (nonzero) digits is 192, while the sum is 17.
Adding to 122320042001 its reverse (100240023221), we get a palindrome (222560065222).
The spelling of 122320042001 in words is "one hundred twenty-two billion, three hundred twenty million, forty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •