Base | Representation |
---|---|
bin | 101111001100110111… |
… | …1000101110000101111 |
3 | 100200122012022122011012 |
4 | 1132121233011300233 |
5 | 3130043024144343 |
6 | 114322111415435 |
7 | 10215611405210 |
oct | 1363157056057 |
9 | 320565278135 |
10 | 101363506223 |
11 | 39a96069551 |
12 | 1778a52457b |
13 | 9735151565 |
14 | 4c98193407 |
15 | 2983cc1718 |
hex | 1799bc5c2f |
101363506223 has 4 divisors (see below), whose sum is σ = 115844007120. Its totient is φ = 86883005328.
The previous prime is 101363506183. The next prime is 101363506243. The reversal of 101363506223 is 322605363101.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 322605363101 = 7 ⋅46086480443.
It is not a de Polignac number, because 101363506223 - 214 = 101363489839 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101363506223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101363506243) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7240250438 + ... + 7240250451.
It is an arithmetic number, because the mean of its divisors is an integer number (28961001780).
Almost surely, 2101363506223 is an apocalyptic number.
101363506223 is a deficient number, since it is larger than the sum of its proper divisors (14480500897).
101363506223 is an equidigital number, since it uses as much as digits as its factorization.
101363506223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14480500896.
The product of its (nonzero) digits is 19440, while the sum is 32.
Adding to 101363506223 its reverse (322605363101), we get a palindrome (423968869324).
The spelling of 101363506223 in words is "one hundred one billion, three hundred sixty-three million, five hundred six thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •