Base | Representation |
---|---|
bin | 10010111010100100… |
… | …10001000001110101 |
3 | 222012201102122200001 |
4 | 21131102101001311 |
5 | 131244140112041 |
6 | 4355400551301 |
7 | 506436052501 |
oct | 113522210165 |
9 | 28181378601 |
10 | 10155004021 |
11 | 4341264908 |
12 | 1b74a82531 |
13 | c5ab4bc26 |
14 | 6c4991301 |
15 | 3e67ca131 |
hex | 25d491075 |
10155004021 has 4 divisors (see below), whose sum is σ = 10187039052. Its totient is φ = 10122968992.
The previous prime is 10155004003. The next prime is 10155004031. The reversal of 10155004021 is 12040055101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2969051121 + 7185952900 = 54489^2 + 84770^2 .
It is a cyclic number.
It is not a de Polignac number, because 10155004021 - 225 = 10121449589 is a prime.
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 10155004021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10155004001) 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, 16017040 + ... + 16017673.
It is an arithmetic number, because the mean of its divisors is an integer number (2546759763).
Almost surely, 210155004021 is an apocalyptic number.
It is an amenable number.
10155004021 is a deficient number, since it is larger than the sum of its proper divisors (32035031).
10155004021 is an equidigital number, since it uses as much as digits as its factorization.
10155004021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32035030.
The product of its (nonzero) digits is 200, while the sum is 19.
Adding to 10155004021 its reverse (12040055101), we get a palindrome (22195059122).
The spelling of 10155004021 in words is "ten billion, one hundred fifty-five million, four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •