Base | Representation |
---|---|
bin | 10010101000001010… |
… | …00100100100010101 |
3 | 221210221210120210212 |
4 | 21110011010210111 |
5 | 130440120101130 |
6 | 4332202255205 |
7 | 502552162634 |
oct | 112405044425 |
9 | 27727716725 |
10 | 10000550165 |
11 | 42720603a1 |
12 | 1b311b7505 |
13 | c34b50a08 |
14 | 6ac26751b |
15 | 3d7e6ae95 |
hex | 254144915 |
10000550165 has 4 divisors (see below), whose sum is σ = 12000660204. Its totient is φ = 8000440128.
The previous prime is 10000550107. The next prime is 10000550171. The reversal of 10000550165 is 56105500001.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 56105500001 = 7541 ⋅7440061.
It can be written as a sum of positive squares in 2 ways, for example, as 2655031729 + 7345518436 = 51527^2 + 85706^2 .
It is a cyclic number.
It is not a de Polignac number, because 10000550165 - 216 = 10000484629 is a prime.
It is a super-2 number, since 2×100005501652 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10000550165.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1000055012 + ... + 1000055021.
It is an arithmetic number, because the mean of its divisors is an integer number (3000165051).
Almost surely, 210000550165 is an apocalyptic number.
It is an amenable number.
10000550165 is a deficient number, since it is larger than the sum of its proper divisors (2000110039).
10000550165 is an equidigital number, since it uses as much as digits as its factorization.
10000550165 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2000110038.
The product of its (nonzero) digits is 750, while the sum is 23.
The spelling of 10000550165 in words is "ten billion, five hundred fifty thousand, one hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •