Base | Representation |
---|---|
bin | 10010101001101001… |
… | …01111011111110101 |
3 | 221211211022110221012 |
4 | 21110310233133311 |
5 | 131001314444043 |
6 | 4333330202005 |
7 | 503063331122 |
oct | 112464573765 |
9 | 27754273835 |
10 | 10013046773 |
11 | 4279116274 |
12 | 1b35423305 |
13 | c37607a62 |
14 | 6adb9b749 |
15 | 3d90d8a18 |
hex | 254d2f7f5 |
10013046773 has 8 divisors (see below), whose sum is σ = 10266563160. Its totient is φ = 9759973120.
The previous prime is 10013046761. The next prime is 10013046781. The reversal of 10013046773 is 37764031001.
It can be written as a sum of positive squares in 4 ways, for example, as 195804049 + 9817242724 = 13993^2 + 99082^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10013046773 - 230 = 8939304949 is a prime.
It is a super-2 number, since 2×100130467732 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10013046713) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 64640 + ... + 155577.
It is an arithmetic number, because the mean of its divisors is an integer number (1283320395).
Almost surely, 210013046773 is an apocalyptic number.
It is an amenable number.
10013046773 is a deficient number, since it is larger than the sum of its proper divisors (253516387).
10013046773 is a wasteful number, since it uses less digits than its factorization.
10013046773 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 221367.
The product of its (nonzero) digits is 10584, while the sum is 32.
Adding to 10013046773 its reverse (37764031001), we get a palindrome (47777077774).
The spelling of 10013046773 in words is "ten billion, thirteen million, forty-six thousand, seven hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •