Base | Representation |
---|---|
bin | 1001001110010111000010… |
… | …1001010101110111001101 |
3 | 1022220121001212012222202102 |
4 | 2103211300221111313031 |
5 | 2312132421230442001 |
6 | 33323151204204445 |
7 | 2064520560525665 |
oct | 223456051256715 |
9 | 38817055188672 |
10 | 10142307671501 |
11 | 32603682a8995 |
12 | 1179792399725 |
13 | 587552b4a3c5 |
14 | 270c670251a5 |
15 | 128c5854de6b |
hex | 93970a55dcd |
10142307671501 has 2 divisors, whose sum is σ = 10142307671502. Its totient is φ = 10142307671500.
The previous prime is 10142307671491. The next prime is 10142307671533. The reversal of 10142307671501 is 10517670324101.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9774695855401 + 367611816100 = 3126451^2 + 606310^2 .
It is a cyclic number.
It is not a de Polignac number, because 10142307671501 - 238 = 9867429764557 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10142307671101) 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, 5071153835750 + 5071153835751.
It is an arithmetic number, because the mean of its divisors is an integer number (5071153835751).
Almost surely, 210142307671501 is an apocalyptic number.
It is an amenable number.
10142307671501 is a deficient number, since it is larger than the sum of its proper divisors (1).
10142307671501 is an equidigital number, since it uses as much as digits as its factorization.
10142307671501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 35280, while the sum is 38.
Adding to 10142307671501 its reverse (10517670324101), we get a palindrome (20659977995602).
The spelling of 10142307671501 in words is "ten trillion, one hundred forty-two billion, three hundred seven million, six hundred seventy-one thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •