Base | Representation |
---|---|
bin | 10011000000100111… |
… | …00000111100111111 |
3 | 222100020202101202222 |
4 | 21200103200330333 |
5 | 131400122204124 |
6 | 4404410435555 |
7 | 510622463435 |
oct | 114023407477 |
9 | 28306671688 |
10 | 10205663039 |
11 | 4367915770 |
12 | 1b89a32bbb |
13 | c684a8290 |
14 | 6cb5bad55 |
15 | 3eae8525e |
hex | 2604e0f3f |
10205663039 has 8 divisors (see below), whose sum is σ = 11989870032. Its totient is φ = 8564192640.
The previous prime is 10205663033. The next prime is 10205663087. The reversal of 10205663039 is 93036650201.
10205663039 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 10205663039 - 28 = 10205662783 is a prime.
It is a super-2 number, since 2×102056630392 (a number of 21 digits) 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 (10205663033) 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 7 ways as a sum of consecutive naturals, for example, 35683994 + ... + 35684279.
It is an arithmetic number, because the mean of its divisors is an integer number (1498733754).
Almost surely, 210205663039 is an apocalyptic number.
10205663039 is a deficient number, since it is larger than the sum of its proper divisors (1784206993).
10205663039 is a wasteful number, since it uses less digits than its factorization.
10205663039 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71368297.
The product of its (nonzero) digits is 29160, while the sum is 35.
The spelling of 10205663039 in words is "ten billion, two hundred five million, six hundred sixty-three thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •