Base | Representation |
---|---|
bin | 10010101011000101… |
… | …10001101001011101 |
3 | 221212200000120100010 |
4 | 21111202301221131 |
5 | 131012412123310 |
6 | 4334440553433 |
7 | 503301031131 |
oct | 112542615135 |
9 | 27780016303 |
10 | 10025114205 |
11 | 4284a08757 |
12 | 1b39482879 |
13 | c39c71652 |
14 | 6b161d3c1 |
15 | 3da1be320 |
hex | 2558b1a5d |
10025114205 has 8 divisors (see below), whose sum is σ = 16040182752. Its totient is φ = 5346727568.
The previous prime is 10025114173. The next prime is 10025114243. The reversal of 10025114205 is 50241152001.
10025114205 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 10025114205 - 25 = 10025114173 is a prime.
It is a congruent number.
It is an unprimeable number.
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, 334170459 + ... + 334170488.
It is an arithmetic number, because the mean of its divisors is an integer number (2005022844).
Almost surely, 210025114205 is an apocalyptic number.
10025114205 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10025114205 is a deficient number, since it is larger than the sum of its proper divisors (6015068547).
10025114205 is an equidigital number, since it uses as much as digits as its factorization.
10025114205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 668340955.
The product of its (nonzero) digits is 400, while the sum is 21.
Adding to 10025114205 its reverse (50241152001), we get a palindrome (60266266206).
The spelling of 10025114205 in words is "ten billion, twenty-five million, one hundred fourteen thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •