Base | Representation |
---|---|
bin | 1001001101001011110110… |
… | …0100001001111111101011 |
3 | 1022211122222011210202121022 |
4 | 2103102331210021333223 |
5 | 2311320102032240243 |
6 | 33310012251403055 |
7 | 2063204436425006 |
oct | 223227544117753 |
9 | 38748864722538 |
10 | 10122123321323 |
11 | 325284a805952 |
12 | 117589a75348b |
13 | 585687207830 |
14 | 26dcb047253d |
15 | 12847651ab68 |
hex | 934bd909feb |
10122123321323 has 16 divisors (see below), whose sum is σ = 10913183662080. Its totient is φ = 9332840964096.
The previous prime is 10122123321313. The next prime is 10122123321341. The reversal of 10122123321323 is 32312332122101.
It is not a de Polignac number, because 10122123321323 - 226 = 10122056212459 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10122123321292 and 10122123321301.
It is not an unprimeable number, because it can be changed into a prime (10122123321313) 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, 249434411 + ... + 249474987.
It is an arithmetic number, because the mean of its divisors is an integer number (682073978880).
Almost surely, 210122123321323 is an apocalyptic number.
10122123321323 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
10122123321323 is a deficient number, since it is larger than the sum of its proper divisors (791060340757).
10122123321323 is a wasteful number, since it uses less digits than its factorization.
10122123321323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62006.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 10122123321323 its reverse (32312332122101), we get a palindrome (42434455443424).
The spelling of 10122123321323 in words is "ten trillion, one hundred twenty-two billion, one hundred twenty-three million, three hundred twenty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •