Base | Representation |
---|---|
bin | 101000111001… |
… | …101011011101 |
3 | 202011201211121 |
4 | 220321223131 |
5 | 10221101023 |
6 | 1021450541 |
7 | 160064341 |
oct | 50715335 |
9 | 22151747 |
10 | 10722013 |
11 | 6063675 |
12 | 3710a51 |
13 | 22b53b3 |
14 | 15d1621 |
15 | e1bd5d |
hex | a39add |
10722013 has 4 divisors (see below), whose sum is σ = 10744000. Its totient is φ = 10700028.
The previous prime is 10721999. The next prime is 10722017. The reversal of 10722013 is 31022701.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 31022701 = 3541 ⋅8761.
It is a cyclic number.
It is not a de Polignac number, because 10722013 - 25 = 10721981 is a prime.
It is a super-2 number, since 2×107220132 = 229923125544338, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10722017) 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, 10245 + ... + 11242.
It is an arithmetic number, because the mean of its divisors is an integer number (2686000).
Almost surely, 210722013 is an apocalyptic number.
It is an amenable number.
10722013 is a deficient number, since it is larger than the sum of its proper divisors (21987).
10722013 is an equidigital number, since it uses as much as digits as its factorization.
10722013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21986.
The product of its (nonzero) digits is 84, while the sum is 16.
The square root of 10722013 is about 3274.4485031834. The cubic root of 10722013 is about 220.5085549168.
Adding to 10722013 its reverse (31022701), we get a palindrome (41744714).
The spelling of 10722013 in words is "ten million, seven hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •