Base | Representation |
---|---|
bin | 1001001110001111010010… |
… | …0010111110000111000111 |
3 | 1022220101200202111011001002 |
4 | 2103203310202332013013 |
5 | 2312114140230022232 |
6 | 33322204430523515 |
7 | 2064415146453101 |
oct | 223436442760707 |
9 | 38811622434032 |
10 | 10140225626567 |
11 | 325a49a0137a3 |
12 | 11792b106659b |
13 | 5872b06a7c5a |
14 | 270b0a6d0571 |
15 | 128b85881b62 |
hex | 938f48be1c7 |
10140225626567 has 2 divisors, whose sum is σ = 10140225626568. Its totient is φ = 10140225626566.
The previous prime is 10140225626501. The next prime is 10140225626603. The reversal of 10140225626567 is 76562652204101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10140225626567 - 226 = 10140158517703 is a prime.
It is a super-2 number, since 2×101402256265672 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10140225626467) 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, 5070112813283 + 5070112813284.
It is an arithmetic number, because the mean of its divisors is an integer number (5070112813284).
Almost surely, 210140225626567 is an apocalyptic number.
10140225626567 is a deficient number, since it is larger than the sum of its proper divisors (1).
10140225626567 is an equidigital number, since it uses as much as digits as its factorization.
10140225626567 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1209600, while the sum is 47.
The spelling of 10140225626567 in words is "ten trillion, one hundred forty billion, two hundred twenty-five million, six hundred twenty-six thousand, five hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •