Base | Representation |
---|---|
bin | 101111001011010101… |
… | …1110111100100011101 |
3 | 100200111122000121121000 |
4 | 1132112223313210131 |
5 | 3124441424030023 |
6 | 114313042500513 |
7 | 10214420411346 |
oct | 1362653674435 |
9 | 320448017530 |
10 | 101312330013 |
11 | 39a6a195064 |
12 | 17775364739 |
13 | 972767398b |
14 | 4c914710cd |
15 | 297e563243 |
hex | 1796af791d |
101312330013 has 8 divisors (see below), whose sum is σ = 150092340800. Its totient is φ = 67541553324.
The previous prime is 101312329981. The next prime is 101312330087. The reversal of 101312330013 is 310033213101.
It is a happy number.
101312330013 is a `hidden beast` number, since 10 + 1 + 312 + 330 + 0 + 13 = 666.
It is not a de Polignac number, because 101312330013 - 25 = 101312329981 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101312330513) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1876154233 + ... + 1876154286.
It is an arithmetic number, because the mean of its divisors is an integer number (18761542600).
Almost surely, 2101312330013 is an apocalyptic number.
It is an amenable number.
101312330013 is a deficient number, since it is larger than the sum of its proper divisors (48780010787).
101312330013 is an equidigital number, since it uses as much as digits as its factorization.
101312330013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3752308528 (or 3752308522 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 101312330013 its reverse (310033213101), we get a palindrome (411345543114).
The spelling of 101312330013 in words is "one hundred one billion, three hundred twelve million, three hundred thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •