Base | Representation |
---|---|
bin | 10011001110011111… |
… | …01110011000111101 |
3 | 222122100212111222212 |
4 | 21213033232120331 |
5 | 132114430010023 |
6 | 4424130350205 |
7 | 513535326125 |
oct | 114717563075 |
9 | 28570774885 |
10 | 10322110013 |
11 | 4417620036 |
12 | 2000a2b365 |
13 | c86659c07 |
14 | 6dcc4dc85 |
15 | 4062d7e78 |
hex | 2673ee63d |
10322110013 has 4 divisors (see below), whose sum is σ = 10416808380. Its totient is φ = 10227411648.
The previous prime is 10322109989. The next prime is 10322110027. The reversal of 10322110013 is 31001122301.
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 6925901284 + 3396208729 = 83222^2 + 58277^2 .
It is a cyclic number.
It is not a de Polignac number, because 10322110013 - 26 = 10322109949 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10322110013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10322110033) 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, 47349020 + ... + 47349237.
It is an arithmetic number, because the mean of its divisors is an integer number (2604202095).
Almost surely, 210322110013 is an apocalyptic number.
It is an amenable number.
10322110013 is a deficient number, since it is larger than the sum of its proper divisors (94698367).
10322110013 is an equidigital number, since it uses as much as digits as its factorization.
10322110013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94698366.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 10322110013 its reverse (31001122301), we get a palindrome (41323232314).
The spelling of 10322110013 in words is "ten billion, three hundred twenty-two million, one hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •