Base | Representation |
---|---|
bin | 10010110110001101… |
… | …10110100000011101 |
3 | 222010011122220002111 |
4 | 21123012312200131 |
5 | 131210311113443 |
6 | 4352013354021 |
7 | 505513316503 |
oct | 113306664035 |
9 | 28104586074 |
10 | 10118457373 |
11 | 4322672872 |
12 | 1b64798911 |
13 | c533c41ab |
14 | 6bdb9a673 |
15 | 3e34ab69d |
hex | 25b1b681d |
10118457373 has 2 divisors, whose sum is σ = 10118457374. Its totient is φ = 10118457372.
The previous prime is 10118457347. The next prime is 10118457383. The reversal of 10118457373 is 37375481101.
10118457373 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8138385369 + 1980072004 = 90213^2 + 44498^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10118457373 is a prime.
It is a super-2 number, since 2×101184573732 (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 (10118457313) 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, 5059228686 + 5059228687.
It is an arithmetic number, because the mean of its divisors is an integer number (5059228687).
Almost surely, 210118457373 is an apocalyptic number.
It is an amenable number.
10118457373 is a deficient number, since it is larger than the sum of its proper divisors (1).
10118457373 is an equidigital number, since it uses as much as digits as its factorization.
10118457373 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 70560, while the sum is 40.
The spelling of 10118457373 in words is "ten billion, one hundred eighteen million, four hundred fifty-seven thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •