Base | Representation |
---|---|
bin | 110000111001101001… |
… | …0001010001011000111 |
3 | 101001001120011011201012 |
4 | 1201303102022023013 |
5 | 3210031404331312 |
6 | 120124212352435 |
7 | 10405220535305 |
oct | 1416322121307 |
9 | 331046134635 |
10 | 105013355207 |
11 | 40599335072 |
12 | 1842891571b |
13 | 9b97366107 |
14 | 5122bdb275 |
15 | 2ae942d322 |
hex | 187348a2c7 |
105013355207 has 2 divisors, whose sum is σ = 105013355208. Its totient is φ = 105013355206.
The previous prime is 105013355177. The next prime is 105013355221. The reversal of 105013355207 is 702553310501.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 105013355207 - 26 = 105013355143 is a prime.
It is a super-2 number, since 2×1050133552072 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105013355807) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52506677603 + 52506677604.
It is an arithmetic number, because the mean of its divisors is an integer number (52506677604).
Almost surely, 2105013355207 is an apocalyptic number.
105013355207 is a deficient number, since it is larger than the sum of its proper divisors (1).
105013355207 is an equidigital number, since it uses as much as digits as its factorization.
105013355207 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15750, while the sum is 32.
Adding to 105013355207 its reverse (702553310501), we get a palindrome (807566665708).
The spelling of 105013355207 in words is "one hundred five billion, thirteen million, three hundred fifty-five thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •