Base | Representation |
---|---|
bin | 101111000011000001… |
… | …1100100010111010011 |
3 | 100122210012000221201001 |
4 | 1132012003210113103 |
5 | 3123404013031011 |
6 | 114225234522431 |
7 | 10204462064536 |
oct | 1360603442723 |
9 | 318705027631 |
10 | 101033330131 |
11 | 39936754348 |
12 | 176b7a36417 |
13 | 96b19195a6 |
14 | 4c663a6a1d |
15 | 2964d017c1 |
hex | 17860e45d3 |
101033330131 has 8 divisors (see below), whose sum is σ = 102819996720. Its totient is φ = 99261869568.
The previous prime is 101033330077. The next prime is 101033330141. The reversal of 101033330131 is 131033330101.
It is a happy number.
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 101033330131 - 29 = 101033329619 is a prime.
It is a super-2 number, since 2×1010333301312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101033330099 and 101033330108.
It is not an unprimeable number, because it can be changed into a prime (101033330141) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3788101 + ... + 3814678.
It is an arithmetic number, because the mean of its divisors is an integer number (12852499590).
Almost surely, 2101033330131 is an apocalyptic number.
101033330131 is a deficient number, since it is larger than the sum of its proper divisors (1786666589).
101033330131 is an equidigital number, since it uses as much as digits as its factorization.
101033330131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7603013.
The product of its (nonzero) digits is 243, while the sum is 19.
Adding to 101033330131 its reverse (131033330101), we get a palindrome (232066660232).
The spelling of 101033330131 in words is "one hundred one billion, thirty-three million, three hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •