Base | Representation |
---|---|
bin | 1000010011011101000000… |
… | …1111000100010111010111 |
3 | 1012022211220020120200120021 |
4 | 2010313100033010113113 |
5 | 2144042323033134332 |
6 | 31230222420450011 |
7 | 1631433215655022 |
oct | 204672017042727 |
9 | 35284806520507 |
10 | 9130299114967 |
11 | 2a00157907808 |
12 | 103561a849907 |
13 | 512ca2a12514 |
14 | 237ca1bb41b9 |
15 | 10c777926c97 |
hex | 84dd03c45d7 |
9130299114967 has 2 divisors, whose sum is σ = 9130299114968. Its totient is φ = 9130299114966.
The previous prime is 9130299114961. The next prime is 9130299114983. The reversal of 9130299114967 is 7694119920319.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 9130299114967 - 239 = 8580543301079 is a prime.
It is a super-2 number, since 2×91302991149672 (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 (9130299114961) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4565149557483 + 4565149557484.
It is an arithmetic number, because the mean of its divisors is an integer number (4565149557484).
Almost surely, 29130299114967 is an apocalyptic number.
9130299114967 is a deficient number, since it is larger than the sum of its proper divisors (1).
9130299114967 is an equidigital number, since it uses as much as digits as its factorization.
9130299114967 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6613488, while the sum is 61.
The spelling of 9130299114967 in words is "nine trillion, one hundred thirty billion, two hundred ninety-nine million, one hundred fourteen thousand, nine hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •