Base | Representation |
---|---|
bin | 101111101001000100… |
… | …1110110011100100101 |
3 | 100210002011101210220121 |
4 | 1133102021312130211 |
5 | 3134012332423402 |
6 | 115000043201541 |
7 | 10251224015653 |
oct | 1372211663445 |
9 | 323064353817 |
10 | 102310045477 |
11 | 3a4313984a2 |
12 | 179b35162b1 |
13 | 9856291063 |
14 | 4d47b85dd3 |
15 | 29dbe42837 |
hex | 17d2276725 |
102310045477 has 2 divisors, whose sum is σ = 102310045478. Its totient is φ = 102310045476.
The previous prime is 102310045417. The next prime is 102310045511. The reversal of 102310045477 is 774540013201.
It is an a-pointer prime, because the next prime (102310045511) can be obtained adding 102310045477 to its sum of digits (34).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 102247097121 + 62948356 = 319761^2 + 7934^2 .
It is an emirp because it is prime and its reverse (774540013201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102310045477 - 223 = 102301656869 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102310045417) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51155022738 + 51155022739.
It is an arithmetic number, because the mean of its divisors is an integer number (51155022739).
Almost surely, 2102310045477 is an apocalyptic number.
It is an amenable number.
102310045477 is a deficient number, since it is larger than the sum of its proper divisors (1).
102310045477 is an equidigital number, since it uses as much as digits as its factorization.
102310045477 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 23520, while the sum is 34.
Adding to 102310045477 its reverse (774540013201), we get a palindrome (876850058678).
The spelling of 102310045477 in words is "one hundred two billion, three hundred ten million, forty-five thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •