Base | Representation |
---|---|
bin | 111000111101001101… |
… | …1110101010101101001 |
3 | 102200201012212101201121 |
4 | 1301322123311111221 |
5 | 4000444134413001 |
6 | 132105004215241 |
7 | 11560015024435 |
oct | 1617233652551 |
9 | 380635771647 |
10 | 122313201001 |
11 | 47966682292 |
12 | 1b85653a521 |
13 | b6c3502064 |
14 | 5cc464d9c5 |
15 | 32ad0d36a1 |
hex | 1c7a6f5569 |
122313201001 has 4 divisors (see below), whose sum is σ = 122317702612. Its totient is φ = 122308699392.
The previous prime is 122313200969. The next prime is 122313201019. The reversal of 122313201001 is 100102313221.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 99300614400 + 23012586601 = 315120^2 + 151699^2 .
It is a cyclic number.
It is not a de Polignac number, because 122313201001 - 25 = 122313200969 is a prime.
It is a super-2 number, since 2×1223132010012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (122313201701) 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, 2209800 + ... + 2264473.
It is an arithmetic number, because the mean of its divisors is an integer number (30579425653).
Almost surely, 2122313201001 is an apocalyptic number.
It is an amenable number.
122313201001 is a deficient number, since it is larger than the sum of its proper divisors (4501611).
122313201001 is an equidigital number, since it uses as much as digits as its factorization.
122313201001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4501610.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 122313201001 its reverse (100102313221), we get a palindrome (222415514222).
The spelling of 122313201001 in words is "one hundred twenty-two billion, three hundred thirteen million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •