Base | Representation |
---|---|
bin | 10011001110101000… |
… | …10110010010011101 |
3 | 222122110011002112202 |
4 | 21213110112102131 |
5 | 132120232301023 |
6 | 4424212341245 |
7 | 513551534504 |
oct | 114724262235 |
9 | 28573132482 |
10 | 10323322013 |
11 | 4418278694 |
12 | 2001314825 |
13 | c86992784 |
14 | 6dd08783b |
15 | 406477128 |
hex | 26751649d |
10323322013 has 2 divisors, whose sum is σ = 10323322014. Its totient is φ = 10323322012.
The previous prime is 10323321989. The next prime is 10323322019. The reversal of 10323322013 is 31022332301.
10323322013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6331862329 + 3991459684 = 79573^2 + 63178^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10323322013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10323322019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5161661006 + 5161661007.
It is an arithmetic number, because the mean of its divisors is an integer number (5161661007).
Almost surely, 210323322013 is an apocalyptic number.
It is an amenable number.
10323322013 is a deficient number, since it is larger than the sum of its proper divisors (1).
10323322013 is an equidigital number, since it uses as much as digits as its factorization.
10323322013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 10323322013 its reverse (31022332301), we get a palindrome (41345654314).
The spelling of 10323322013 in words is "ten billion, three hundred twenty-three million, three hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •