Base | Representation |
---|---|
bin | 101111000110100000… |
… | …1000100010110011111 |
3 | 100200002022210020202010 |
4 | 1132031001010112133 |
5 | 3124123412141411 |
6 | 114245010002303 |
7 | 10210410536064 |
oct | 1361501042637 |
9 | 320068706663 |
10 | 101150115231 |
11 | 3999666a760 |
12 | 1772ab76393 |
13 | 96ccb890b9 |
14 | 4c77ac6c6b |
15 | 29701be7a6 |
hex | 178d04459f |
101150115231 has 64 divisors (see below), whose sum is σ = 154906214400. Its totient is φ = 58112250240.
The previous prime is 101150115191. The next prime is 101150115299. The reversal of 101150115231 is 132511051101.
It is not a de Polignac number, because 101150115231 - 27 = 101150115103 is a prime.
It is a super-2 number, since 2×1011501152312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101150115198 and 101150115207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101150115431) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 48188620 + ... + 48190718.
It is an arithmetic number, because the mean of its divisors is an integer number (2420409600).
Almost surely, 2101150115231 is an apocalyptic number.
101150115231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
101150115231 is a deficient number, since it is larger than the sum of its proper divisors (53756099169).
101150115231 is a wasteful number, since it uses less digits than its factorization.
101150115231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2676.
The product of its (nonzero) digits is 150, while the sum is 21.
Adding to 101150115231 its reverse (132511051101), we get a palindrome (233661166332).
The spelling of 101150115231 in words is "one hundred one billion, one hundred fifty million, one hundred fifteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •