Base | Representation |
---|---|
bin | 11101001010001110… |
… | …11111011001011110 |
3 | 1111102000211210101000 |
4 | 32211013133121132 |
5 | 224030201344032 |
6 | 11105235131130 |
7 | 1062643130604 |
oct | 164507373136 |
9 | 44360753330 |
10 | 15655106142 |
11 | 6703998a55 |
12 | 304aa43aa6 |
13 | 162649a220 |
14 | a87233874 |
15 | 6195b9e7c |
hex | 3a51df65e |
15655106142 has 64 divisors (see below), whose sum is σ = 37570176000. Its totient is φ = 4803460704.
The previous prime is 15655106099. The next prime is 15655106189. The reversal of 15655106142 is 24160155651.
15655106142 is a `hidden beast` number, since 1 + 5 + 6 + 551 + 0 + 61 + 42 = 666.
It is a super-2 number, since 2×156551061422 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 15655106097 and 15655106106.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 220959 + ... + 283077.
It is an arithmetic number, because the mean of its divisors is an integer number (587034000).
Almost surely, 215655106142 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 15655106142, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18785088000).
15655106142 is an abundant number, since it is smaller than the sum of its proper divisors (21915069858).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15655106142 is a wasteful number, since it uses less digits than its factorization.
15655106142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62502 (or 62496 counting only the distinct ones).
The product of its (nonzero) digits is 36000, while the sum is 36.
The spelling of 15655106142 in words is "fifteen billion, six hundred fifty-five million, one hundred six thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •