Base | Representation |
---|---|
bin | 10110111101111001110101… |
… | …011000010111111001100011 |
3 | 111020122120001222100121100122 |
4 | 112331321311120113321203 |
5 | 101214431022102102242 |
6 | 554455452323510455 |
7 | 30163542666030323 |
oct | 2675716530277143 |
9 | 436576058317318 |
10 | 101011010190947 |
11 | 2a20458a9a052a |
12 | b3b473ab2842b |
13 | 44493b349686c |
14 | 1ad2d5d61d283 |
15 | ba27dc939ad2 |
hex | 5bde75617e63 |
101011010190947 has 2 divisors, whose sum is σ = 101011010190948. Its totient is φ = 101011010190946.
The previous prime is 101011010190919. The next prime is 101011010190967. The reversal of 101011010190947 is 749091010110101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101011010190947 - 232 = 101006715223651 is a prime.
It is not a weakly prime, because it can be changed into another prime (101011010190967) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50505505095473 + 50505505095474.
It is an arithmetic number, because the mean of its divisors is an integer number (50505505095474).
Almost surely, 2101011010190947 is an apocalyptic number.
101011010190947 is a deficient number, since it is larger than the sum of its proper divisors (1).
101011010190947 is an equidigital number, since it uses as much as digits as its factorization.
101011010190947 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2268, while the sum is 35.
The spelling of 101011010190947 in words is "one hundred one trillion, eleven billion, ten million, one hundred ninety thousand, nine hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •