Base | Representation |
---|---|
bin | 1001001010011111110000… |
… | …0101100010111011111001 |
3 | 1022200020201201110001120011 |
4 | 2102213330011202323321 |
5 | 2310040444432340434 |
6 | 33232452305301521 |
7 | 2056650610441021 |
oct | 222477405427371 |
9 | 38606651401504 |
10 | 10075927621369 |
11 | 32351a4510825 |
12 | 11689479348a1 |
13 | 58120467952c |
14 | 26b96b0b2a81 |
15 | 127170b40e64 |
hex | 929fc162ef9 |
10075927621369 has 2 divisors, whose sum is σ = 10075927621370. Its totient is φ = 10075927621368.
The previous prime is 10075927621351. The next prime is 10075927621453. The reversal of 10075927621369 is 96312672957001.
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., 9063640105744 + 1012287515625 = 3010588^2 + 1006125^2 .
It is an emirp because it is prime and its reverse (96312672957001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10075927621369 - 231 = 10073780137721 is a prime.
It is a super-2 number, since 2×100759276213692 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10075927621469) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5037963810684 + 5037963810685.
It is an arithmetic number, because the mean of its divisors is an integer number (5037963810685).
Almost surely, 210075927621369 is an apocalyptic number.
It is an amenable number.
10075927621369 is a deficient number, since it is larger than the sum of its proper divisors (1).
10075927621369 is an equidigital number, since it uses as much as digits as its factorization.
10075927621369 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8573040, while the sum is 58.
The spelling of 10075927621369 in words is "ten trillion, seventy-five billion, nine hundred twenty-seven million, six hundred twenty-one thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.039 sec. • engine limits •