Base | Representation |
---|---|
bin | 1110101000010… |
… | …01101011000101 |
3 | 22112220222022210 |
4 | 13110021223011 |
5 | 222404114023 |
6 | 20102214033 |
7 | 3020062020 |
oct | 724115305 |
9 | 275828283 |
10 | 122723013 |
11 | 63301686 |
12 | 35124319 |
13 | 1c56b48a |
14 | 124281b7 |
15 | ab92593 |
hex | 7509ac5 |
122723013 has 8 divisors (see below), whose sum is σ = 187006528. Its totient is φ = 70127424.
The previous prime is 122723011. The next prime is 122723057. The reversal of 122723013 is 310327221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 122723013 - 21 = 122723011 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 5843953 = 122723013 / (1 + 2 + 2 + 7 + 2 + 3 + 0 + 1 + 3).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122723011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2921956 + ... + 2921997.
It is an arithmetic number, because the mean of its divisors is an integer number (23375816).
Almost surely, 2122723013 is an apocalyptic number.
It is an amenable number.
122723013 is a deficient number, since it is larger than the sum of its proper divisors (64283515).
122723013 is an equidigital number, since it uses as much as digits as its factorization.
122723013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5843963.
The product of its (nonzero) digits is 504, while the sum is 21.
The square root of 122723013 is about 11078.0419298719. The cubic root of 122723013 is about 496.9453941007.
The spelling of 122723013 in words is "one hundred twenty-two million, seven hundred twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •