Base | Representation |
---|---|
bin | 110010110010010001… |
… | …0010111011110000111 |
3 | 101102111122100102020020 |
4 | 1211210202113132013 |
5 | 3241324043204111 |
6 | 122034001510223 |
7 | 10610426315400 |
oct | 1454442273607 |
9 | 342448312206 |
10 | 109060913031 |
11 | 42286051184 |
12 | 19178342373 |
13 | a390a99445 |
14 | 53c85b09a7 |
15 | 2c84949906 |
hex | 1964897787 |
109060913031 has 48 divisors (see below), whose sum is σ = 175155683040. Its totient is φ = 60114109440.
The previous prime is 109060913023. The next prime is 109060913041. The reversal of 109060913031 is 130319060901.
It is a happy number.
It is not a de Polignac number, because 109060913031 - 23 = 109060913023 is a prime.
It is a super-2 number, since 2×1090609130312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 109060912983 and 109060913001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (109060913041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4664851 + ... + 4688171.
It is an arithmetic number, because the mean of its divisors is an integer number (3649076730).
Almost surely, 2109060913031 is an apocalyptic number.
109060913031 is a deficient number, since it is larger than the sum of its proper divisors (66094770009).
109060913031 is a wasteful number, since it uses less digits than its factorization.
109060913031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24464 (or 24457 counting only the distinct ones).
The product of its (nonzero) digits is 4374, while the sum is 33.
Adding to 109060913031 its reverse (130319060901), we get a palindrome (239379973932).
The spelling of 109060913031 in words is "one hundred nine billion, sixty million, nine hundred thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •