Base | Representation |
---|---|
bin | 110000110111111110… |
… | …0111110000101111101 |
3 | 101000220122222212022122 |
4 | 1201233330332011331 |
5 | 3204423103002203 |
6 | 120114454452325 |
7 | 10403641524023 |
oct | 1415774760575 |
9 | 330818885278 |
10 | 104957469053 |
11 | 4056a833a68 |
12 | 184120640a5 |
13 | 9b888c9798 |
14 | 5119610713 |
15 | 2ae458e538 |
hex | 186ff3e17d |
104957469053 has 2 divisors, whose sum is σ = 104957469054. Its totient is φ = 104957469052.
The previous prime is 104957469049. The next prime is 104957469131. The reversal of 104957469053 is 350964759401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 53547348409 + 51410120644 = 231403^2 + 226738^2 .
It is an emirp because it is prime and its reverse (350964759401) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 104957469053 - 22 = 104957469049 is a prime.
It is a super-2 number, since 2×1049574690532 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 104957468986 and 104957469004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (104957429053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52478734526 + 52478734527.
It is an arithmetic number, because the mean of its divisors is an integer number (52478734527).
Almost surely, 2104957469053 is an apocalyptic number.
It is an amenable number.
104957469053 is a deficient number, since it is larger than the sum of its proper divisors (1).
104957469053 is an equidigital number, since it uses as much as digits as its factorization.
104957469053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4082400, while the sum is 53.
The spelling of 104957469053 in words is "one hundred four billion, nine hundred fifty-seven million, four hundred sixty-nine thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •