Base | Representation |
---|---|
bin | 10010111001111111… |
… | …01110110110011101 |
3 | 222012101021210221111 |
4 | 21130333232312131 |
5 | 131241414123222 |
6 | 4355104502021 |
7 | 506346545515 |
oct | 113477566635 |
9 | 28171253844 |
10 | 10150145437 |
11 | 4339546553 |
12 | 1b7331a911 |
13 | c59b3a623 |
14 | 6c4088845 |
15 | 3e616a777 |
hex | 25cfeed9d |
10150145437 has 2 divisors, whose sum is σ = 10150145438. Its totient is φ = 10150145436.
The previous prime is 10150145413. The next prime is 10150145501. The reversal of 10150145437 is 73454105101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9384571876 + 765573561 = 96874^2 + 27669^2 .
It is a cyclic number.
It is not a de Polignac number, because 10150145437 - 27 = 10150145309 is a prime.
It is a super-3 number, since 3×101501454373 (a number of 31 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10150145399 and 10150145408.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10150145407) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5075072718 + 5075072719.
It is an arithmetic number, because the mean of its divisors is an integer number (5075072719).
Almost surely, 210150145437 is an apocalyptic number.
It is an amenable number.
10150145437 is a deficient number, since it is larger than the sum of its proper divisors (1).
10150145437 is an equidigital number, since it uses as much as digits as its factorization.
10150145437 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8400, while the sum is 31.
The spelling of 10150145437 in words is "ten billion, one hundred fifty million, one hundred forty-five thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •