Base | Representation |
---|---|
bin | 111000111100110111… |
… | …0100001001100011101 |
3 | 102200200101111212211002 |
4 | 1301321232201030131 |
5 | 4000433114301023 |
6 | 132103501440045 |
7 | 11556512041013 |
oct | 1617156411435 |
9 | 380611455732 |
10 | 122301322013 |
11 | 4795a9a9442 |
12 | 1b852570025 |
13 | b6c0c03180 |
14 | 5cc2c3a8b3 |
15 | 32ac038b28 |
hex | 1c79ba131d |
122301322013 has 16 divisors (see below), whose sum is σ = 135309214656. Its totient is φ = 109828656000.
The previous prime is 122301321991. The next prime is 122301322037. The reversal of 122301322013 is 310223103221.
It is a cyclic number.
It is not a de Polignac number, because 122301322013 - 28 = 122301321757 is a prime.
It is a super-3 number, since 3×1223013220133 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122301322093) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 295520 + ... + 576137.
It is an arithmetic number, because the mean of its divisors is an integer number (8456825916).
Almost surely, 2122301322013 is an apocalyptic number.
122301322013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
122301322013 is a deficient number, since it is larger than the sum of its proper divisors (13007892643).
122301322013 is a wasteful number, since it uses less digits than its factorization.
122301322013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 871964.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 122301322013 its reverse (310223103221), we get a palindrome (432524425234).
The spelling of 122301322013 in words is "one hundred twenty-two billion, three hundred one million, three hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •