Base | Representation |
---|---|
bin | 1001000110101110000000… |
… | …0000111110001010001111 |
3 | 1022110001020001011120111101 |
4 | 2101223200000332022033 |
5 | 2303010043212310141 |
6 | 33143001002203531 |
7 | 2052162465154006 |
oct | 221534000761217 |
9 | 38401201146441 |
10 | 10011032150671 |
11 | 320a722731112 |
12 | 11582564b35a7 |
13 | 57806192ba26 |
14 | 2687723abc3d |
15 | 125623733531 |
hex | 91ae003e28f |
10011032150671 has 2 divisors, whose sum is σ = 10011032150672. Its totient is φ = 10011032150670.
The previous prime is 10011032150573. The next prime is 10011032150719. The reversal of 10011032150671 is 17605123011001.
It is a strong prime.
It is an emirp because it is prime and its reverse (17605123011001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10011032150671 - 227 = 10010897932943 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10011032151671) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5005516075335 + 5005516075336.
It is an arithmetic number, because the mean of its divisors is an integer number (5005516075336).
Almost surely, 210011032150671 is an apocalyptic number.
10011032150671 is a deficient number, since it is larger than the sum of its proper divisors (1).
10011032150671 is an equidigital number, since it uses as much as digits as its factorization.
10011032150671 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1260, while the sum is 28.
Adding to 10011032150671 its reverse (17605123011001), we get a palindrome (27616155161672).
The spelling of 10011032150671 in words is "ten trillion, eleven billion, thirty-two million, one hundred fifty thousand, six hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •