Base | Representation |
---|---|
bin | 10011000001101010… |
… | …10001001111000101 |
3 | 222100212101221122212 |
4 | 21200311101033011 |
5 | 131404403332212 |
6 | 4405324233205 |
7 | 511060626035 |
oct | 114065211705 |
9 | 28325357585 |
10 | 10214511557 |
11 | 4371909798 |
12 | 1b9099b805 |
13 | c6a2859a3 |
14 | 6cc8418c5 |
15 | 3ebb31e22 |
hex | 260d513c5 |
10214511557 has 4 divisors (see below), whose sum is σ = 10815365196. Its totient is φ = 9613657920.
The previous prime is 10214511553. The next prime is 10214511647. The reversal of 10214511557 is 75511541201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 75511541201 = 23 ⋅3283110487.
It can be written as a sum of positive squares in 2 ways, for example, as 3233741956 + 6980769601 = 56866^2 + 83551^2 .
It is a cyclic number.
It is not a de Polignac number, because 10214511557 - 22 = 10214511553 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 (10214511553) 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, 300426794 + ... + 300426827.
It is an arithmetic number, because the mean of its divisors is an integer number (2703841299).
Almost surely, 210214511557 is an apocalyptic number.
10214511557 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
10214511557 is a deficient number, since it is larger than the sum of its proper divisors (600853639).
10214511557 is an equidigital number, since it uses as much as digits as its factorization.
10214511557 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 600853638.
The product of its (nonzero) digits is 7000, while the sum is 32.
The spelling of 10214511557 in words is "ten billion, two hundred fourteen million, five hundred eleven thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •