Base | Representation |
---|---|
bin | 101111000101001010… |
… | …1000000010101011101 |
3 | 100122222011220200000111 |
4 | 1132022111000111131 |
5 | 3124030340310023 |
6 | 114240315130021 |
7 | 10206322256020 |
oct | 1361225002535 |
9 | 318864820014 |
10 | 101105010013 |
11 | 39973162517 |
12 | 17717a43911 |
13 | 96c3725917 |
14 | 4c71b051b7 |
15 | 296b26000d |
hex | 178a54055d |
101105010013 has 8 divisors (see below), whose sum is σ = 115550637120. Its totient is φ = 86659896480.
The previous prime is 101105010011. The next prime is 101105010049. The reversal of 101105010013 is 310010501101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101105010013 - 21 = 101105010011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101105009975 and 101105010002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101105010011) 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 in 7 ways as a sum of consecutive naturals, for example, 495753 + ... + 669313.
It is an arithmetic number, because the mean of its divisors is an integer number (14443829640).
Almost surely, 2101105010013 is an apocalyptic number.
It is an amenable number.
101105010013 is a deficient number, since it is larger than the sum of its proper divisors (14445627107).
101105010013 is an equidigital number, since it uses as much as digits as its factorization.
101105010013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 256787.
The product of its (nonzero) digits is 15, while the sum is 13.
Adding to 101105010013 its reverse (310010501101), we get a palindrome (411115511114).
The spelling of 101105010013 in words is "one hundred one billion, one hundred five million, ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •