Base | Representation |
---|---|
bin | 10011010110000010… |
… | …10110011010110101 |
3 | 222210210001120001101 |
4 | 21223001112122311 |
5 | 132232133410202 |
6 | 4434312130101 |
7 | 515234605600 |
oct | 115301263265 |
9 | 28723046041 |
10 | 10385450677 |
11 | 444a352898 |
12 | 201a096931 |
13 | c968065b4 |
14 | 70741b337 |
15 | 40bb4a887 |
hex | 26b0566b5 |
10385450677 has 24 divisors (see below), whose sum is σ = 12166080000. Its totient is φ = 8839375776.
The previous prime is 10385450653. The next prime is 10385450701. The reversal of 10385450677 is 77605458301.
10385450677 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (10385450653) and next prime (10385450701).
It is not a de Polignac number, because 10385450677 - 219 = 10384926389 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10385450627) 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 in 23 ways as a sum of consecutive naturals, for example, 5194324 + ... + 5196322.
It is an arithmetic number, because the mean of its divisors is an integer number (506920000).
Almost surely, 210385450677 is an apocalyptic number.
It is an amenable number.
10385450677 is a deficient number, since it is larger than the sum of its proper divisors (1780629323).
10385450677 is a wasteful number, since it uses less digits than its factorization.
10385450677 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2705 (or 2698 counting only the distinct ones).
The product of its (nonzero) digits is 705600, while the sum is 46.
The spelling of 10385450677 in words is "ten billion, three hundred eighty-five million, four hundred fifty thousand, six hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •