Base | Representation |
---|---|
bin | 10010111010000010… |
… | …10111110111110001 |
3 | 222012102002200000111 |
4 | 21131001113313301 |
5 | 131242021404401 |
6 | 4355122021321 |
7 | 506353316605 |
oct | 113501276761 |
9 | 28172080014 |
10 | 10150575601 |
11 | 433980a761 |
12 | 1b734a7841 |
13 | c59c5b36a |
14 | 6c415b505 |
15 | 3e6202e51 |
hex | 25d057df1 |
10150575601 has 2 divisors, whose sum is σ = 10150575602. Its totient is φ = 10150575600.
The previous prime is 10150575587. The next prime is 10150575607. The reversal of 10150575601 is 10657505101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5879822400 + 4270753201 = 76680^2 + 65351^2 .
It is a cyclic number.
It is not a de Polignac number, because 10150575601 - 25 = 10150575569 is a prime.
It is a super-2 number, since 2×101505756012 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10150575607) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5075287800 + 5075287801.
It is an arithmetic number, because the mean of its divisors is an integer number (5075287801).
Almost surely, 210150575601 is an apocalyptic number.
It is an amenable number.
10150575601 is a deficient number, since it is larger than the sum of its proper divisors (1).
10150575601 is an equidigital number, since it uses as much as digits as its factorization.
10150575601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5250, while the sum is 31.
The spelling of 10150575601 in words is "ten billion, one hundred fifty million, five hundred seventy-five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •