Base | Representation |
---|---|
bin | 1001001110001111100101… |
… | …0111111010101100100001 |
3 | 1022220101220101212210101101 |
4 | 2103203321113322230201 |
5 | 2312114321443140243 |
6 | 33322220442434401 |
7 | 2064420152034145 |
oct | 223437127725441 |
9 | 38811811783341 |
10 | 10140306615073 |
11 | 325a5307aa648 |
12 | 1179314202a01 |
13 | 5872c43c324b |
14 | 270b17373225 |
15 | 128b8ca2d54d |
hex | 938f95fab21 |
10140306615073 has 2 divisors, whose sum is σ = 10140306615074. Its totient is φ = 10140306615072.
The previous prime is 10140306614863. The next prime is 10140306615083. The reversal of 10140306615073 is 37051660304101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9558033842449 + 582272772624 = 3091607^2 + 763068^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10140306615073 is a prime.
It is a super-3 number, since 3×101403066150733 (a number of 40 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (10140306615083) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5070153307536 + 5070153307537.
It is an arithmetic number, because the mean of its divisors is an integer number (5070153307537).
Almost surely, 210140306615073 is an apocalyptic number.
It is an amenable number.
10140306615073 is a deficient number, since it is larger than the sum of its proper divisors (1).
10140306615073 is an equidigital number, since it uses as much as digits as its factorization.
10140306615073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 45360, while the sum is 37.
Adding to 10140306615073 its reverse (37051660304101), we get a palindrome (47191966919174).
The spelling of 10140306615073 in words is "ten trillion, one hundred forty billion, three hundred six million, six hundred fifteen thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •