Base | Representation |
---|---|
bin | 110001010111001100… |
… | …1000000110001011101 |
3 | 101010121200010022212011 |
4 | 1202232121000301131 |
5 | 3214044240214303 |
6 | 120410435111221 |
7 | 10441621460602 |
oct | 1425631006135 |
9 | 333550108764 |
10 | 106005007453 |
11 | 40a58077084 |
12 | 18664a42511 |
13 | 9cc493c7a7 |
14 | 51b87b46a9 |
15 | 2b5651116d |
hex | 18ae640c5d |
106005007453 has 2 divisors, whose sum is σ = 106005007454. Its totient is φ = 106005007452.
The previous prime is 106005007421. The next prime is 106005007483. The reversal of 106005007453 is 354700500601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 89265305529 + 16739701924 = 298773^2 + 129382^2 .
It is an emirp because it is prime and its reverse (354700500601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 106005007453 - 25 = 106005007421 is a prime.
It is a super-2 number, since 2×1060050074532 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106005007403) by changing a digit.
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 as a sum of consecutive naturals, namely, 53002503726 + 53002503727.
It is an arithmetic number, because the mean of its divisors is an integer number (53002503727).
Almost surely, 2106005007453 is an apocalyptic number.
It is an amenable number.
106005007453 is a deficient number, since it is larger than the sum of its proper divisors (1).
106005007453 is an equidigital number, since it uses as much as digits as its factorization.
106005007453 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12600, while the sum is 31.
The spelling of 106005007453 in words is "one hundred six billion, five million, seven thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •