Base | Representation |
---|---|
bin | 110000101000000001… |
… | …1000101011100101011 |
3 | 100222112100210102202210 |
4 | 1201100003011130223 |
5 | 3202324040414011 |
6 | 115545414100203 |
7 | 10354452031113 |
oct | 1412003053453 |
9 | 328470712683 |
10 | 104422201131 |
11 | 40315679286 |
12 | 182a294a663 |
13 | 9b01a469c1 |
14 | 50a84b8043 |
15 | 2ab25ab6a6 |
hex | 18500c572b |
104422201131 has 16 divisors (see below), whose sum is σ = 143729804288. Its totient is φ = 67364978400.
The previous prime is 104422201129. The next prime is 104422201133. The reversal of 104422201131 is 131102224401.
It is an interprime number because it is at equal distance from previous prime (104422201129) and next prime (104422201133).
It is not a de Polignac number, because 104422201131 - 21 = 104422201129 is a prime.
It is a super-2 number, since 2×1044222011312 (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 = 104422201098 and 104422201107.
It is not an unprimeable number, because it can be changed into a prime (104422201133) 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, 2324796 + ... + 2369286.
It is an arithmetic number, because the mean of its divisors is an integer number (8983112768).
Almost surely, 2104422201131 is an apocalyptic number.
104422201131 is a deficient number, since it is larger than the sum of its proper divisors (39307603157).
104422201131 is a wasteful number, since it uses less digits than its factorization.
104422201131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69762.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 104422201131 its reverse (131102224401), we get a palindrome (235524425532).
The spelling of 104422201131 in words is "one hundred four billion, four hundred twenty-two million, two hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •