Base | Representation |
---|---|
bin | 10111011100010100011011… |
… | …011100111111001011100011 |
3 | 111112001101002110010211101101 |
4 | 113130110123130333023203 |
5 | 102003202124013233011 |
6 | 1003140003101015231 |
7 | 30500545423520524 |
oct | 2734243334771343 |
9 | 445041073124341 |
10 | 103101150524131 |
11 | 2a93aa526a1841 |
12 | b69183a854517 |
13 | 456b520946096 |
14 | 1b6619d89a84b |
15 | bdbd6e2642c1 |
hex | 5dc51b73f2e3 |
103101150524131 has 16 divisors (see below), whose sum is σ = 112955325366240. Its totient is φ = 93669505251840.
The previous prime is 103101150524129. The next prime is 103101150524147. The reversal of 103101150524131 is 131425051101301.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 103101150524131 - 21 = 103101150524129 is a prime.
It is a super-2 number, since 2×1031011505241312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 103101150524131.
It is not an unprimeable number, because it can be changed into a prime (103101150524831) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20978640 + ... + 25422541.
It is an arithmetic number, because the mean of its divisors is an integer number (7059707835390).
Almost surely, 2103101150524131 is an apocalyptic number.
103101150524131 is a deficient number, since it is larger than the sum of its proper divisors (9854174842109).
103101150524131 is a wasteful number, since it uses less digits than its factorization.
103101150524131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46405734.
The product of its (nonzero) digits is 1800, while the sum is 28.
The spelling of 103101150524131 in words is "one hundred three trillion, one hundred one billion, one hundred fifty million, five hundred twenty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •