Base | Representation |
---|---|
bin | 101110101110000110… |
… | …0110001101101100111 |
3 | 100120222020200000110212 |
4 | 1131130030301231213 |
5 | 3120434230213111 |
6 | 114031431410035 |
7 | 10151204200430 |
oct | 1353414615547 |
9 | 316866600425 |
10 | 100331101031 |
11 | 39606322217 |
12 | 1754082391b |
13 | 95cc2a9705 |
14 | 4bdb00c487 |
15 | 292333d98b |
hex | 175c331b67 |
100331101031 has 8 divisors (see below), whose sum is σ = 118618050720. Its totient is φ = 83032635168.
The previous prime is 100331101027. The next prime is 100331101049. The reversal of 100331101031 is 130101133001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100331101031 - 22 = 100331101027 is a prime.
It is a super-2 number, since 2×1003311010312 (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 = 100331100997 and 100331101015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100331101051) 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, 247120736 + ... + 247121141.
It is an arithmetic number, because the mean of its divisors is an integer number (14827256340).
Almost surely, 2100331101031 is an apocalyptic number.
100331101031 is a deficient number, since it is larger than the sum of its proper divisors (18286949689).
100331101031 is an equidigital number, since it uses as much as digits as its factorization.
100331101031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 494241913.
The product of its (nonzero) digits is 27, while the sum is 14.
Adding to 100331101031 its reverse (130101133001), we get a palindrome (230432234032).
The spelling of 100331101031 in words is "one hundred billion, three hundred thirty-one million, one hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •