Base | Representation |
---|---|
bin | 101111001111100111… |
… | …0010000101000110001 |
3 | 100200212121112121202001 |
4 | 1132133032100220301 |
5 | 3130240111011223 |
6 | 114335200454001 |
7 | 10221110026216 |
oct | 1363716205061 |
9 | 320777477661 |
10 | 101455563313 |
11 | 3a033025395 |
12 | 177b531a301 |
13 | 974b243900 |
14 | 4ca64b7b0d |
15 | 298be079ad |
hex | 179f390a31 |
101455563313 has 24 divisors (see below), whose sum is σ = 111575392800. Its totient is φ = 92191042944.
The previous prime is 101455563289. The next prime is 101455563337. The reversal of 101455563313 is 313365554101.
It is an interprime number because it is at equal distance from previous prime (101455563289) and next prime (101455563337).
It is not a de Polignac number, because 101455563313 - 217 = 101455432241 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101455563383) 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 in 23 ways as a sum of consecutive naturals, for example, 28747333 + ... + 28750861.
It is an arithmetic number, because the mean of its divisors is an integer number (4648974700).
Almost surely, 2101455563313 is an apocalyptic number.
101455563313 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
101455563313 is a deficient number, since it is larger than the sum of its proper divisors (10119829487).
101455563313 is a wasteful number, since it uses less digits than its factorization.
101455563313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6161 (or 6148 counting only the distinct ones).
The product of its (nonzero) digits is 81000, while the sum is 37.
The spelling of 101455563313 in words is "one hundred one billion, four hundred fifty-five million, five hundred sixty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •