Base | Representation |
---|---|
bin | 10011100100000101… |
… | …00101010001001101 |
3 | 1000002222122120011202 |
4 | 21302002211101031 |
5 | 133002310323112 |
6 | 4454120155245 |
7 | 521164563422 |
oct | 116202452115 |
9 | 30088576152 |
10 | 10503214157 |
11 | 44aa877287 |
12 | 2051608b25 |
13 | cb5029527 |
14 | 718d13d49 |
15 | 41715d6c2 |
hex | 2720a544d |
10503214157 has 2 divisors, whose sum is σ = 10503214158. Its totient is φ = 10503214156.
The previous prime is 10503214153. The next prime is 10503214177. The reversal of 10503214157 is 75141230501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10449132841 + 54081316 = 102221^2 + 7354^2 .
It is a cyclic number.
It is not a de Polignac number, because 10503214157 - 22 = 10503214153 is a prime.
It is a super-2 number, since 2×105032141572 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10503214153) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5251607078 + 5251607079.
It is an arithmetic number, because the mean of its divisors is an integer number (5251607079).
Almost surely, 210503214157 is an apocalyptic number.
It is an amenable number.
10503214157 is a deficient number, since it is larger than the sum of its proper divisors (1).
10503214157 is an equidigital number, since it uses as much as digits as its factorization.
10503214157 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4200, while the sum is 29.
Adding to 10503214157 its reverse (75141230501), we get a palindrome (85644444658).
The spelling of 10503214157 in words is "ten billion, five hundred three million, two hundred fourteen thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •