Base | Representation |
---|---|
bin | 101111001011010001… |
… | …1000110100010100001 |
3 | 100200111110200212100122 |
4 | 1132112203012202201 |
5 | 3124440332011113 |
6 | 114312521330025 |
7 | 10214362030610 |
oct | 1362643064241 |
9 | 320443625318 |
10 | 101310032033 |
11 | 39a68965601 |
12 | 17774636915 |
13 | 972704aa22 |
14 | 4c91033877 |
15 | 297e25c408 |
hex | 17968c68a1 |
101310032033 has 16 divisors (see below), whose sum is σ = 124671519360. Its totient is φ = 80343856896.
The previous prime is 101310032009. The next prime is 101310032039. The reversal of 101310032033 is 330230013101.
It is a cyclic number.
It is not a de Polignac number, because 101310032033 - 26 = 101310031969 is a prime.
It is a super-2 number, since 2×1013100320332 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101310032039) 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 15 ways as a sum of consecutive naturals, for example, 7207766 + ... + 7221807.
It is an arithmetic number, because the mean of its divisors is an integer number (7791969960).
Almost surely, 2101310032033 is an apocalyptic number.
It is an amenable number.
101310032033 is a deficient number, since it is larger than the sum of its proper divisors (23361487327).
101310032033 is a wasteful number, since it uses less digits than its factorization.
101310032033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14429656.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 101310032033 its reverse (330230013101), we get a palindrome (431540045134).
The spelling of 101310032033 in words is "one hundred one billion, three hundred ten million, thirty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •