Base | Representation |
---|---|
bin | 10010110010111110… |
… | …01111101011100011 |
3 | 222001021120000202112 |
4 | 21121133033223203 |
5 | 131131333010012 |
6 | 4345203305535 |
7 | 505033420304 |
oct | 113137175343 |
9 | 28037500675 |
10 | 10091297507 |
11 | 43093021a5 |
12 | 1b5767b2ab |
13 | c4a8a4b75 |
14 | 6ba32a7ab |
15 | 3e0de4122 |
hex | 2597cfae3 |
10091297507 has 2 divisors, whose sum is σ = 10091297508. Its totient is φ = 10091297506.
The previous prime is 10091297501. The next prime is 10091297549. The reversal of 10091297507 is 70579219001.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (70579219001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10091297507 - 26 = 10091297443 is a prime.
It is a super-5 number, since 5×100912975075 (a number of 51 digits) contains 55555 as substring.
It is not a weakly prime, because it can be changed into another prime (10091297501) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5045648753 + 5045648754.
It is an arithmetic number, because the mean of its divisors is an integer number (5045648754).
Almost surely, 210091297507 is an apocalyptic number.
10091297507 is a deficient number, since it is larger than the sum of its proper divisors (1).
10091297507 is an equidigital number, since it uses as much as digits as its factorization.
10091297507 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 39690, while the sum is 41.
The spelling of 10091297507 in words is "ten billion, ninety-one million, two hundred ninety-seven thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •