Base | Representation |
---|---|
bin | 11100001001010010… |
… | …00110110010111110 |
3 | 1110000001122020212220 |
4 | 32010221012302332 |
5 | 221421212121032 |
6 | 10535213310210 |
7 | 1043306114502 |
oct | 160451066276 |
9 | 43001566786 |
10 | 15110270142 |
11 | 6454398670 |
12 | 2b18495366 |
13 | 156a647366 |
14 | a34b2a302 |
15 | 5d684712c |
hex | 384a46cbe |
15110270142 has 64 divisors (see below), whose sum is σ = 34284072960. Its totient is φ = 4397724800.
The previous prime is 15110270137. The next prime is 15110270159. The reversal of 15110270142 is 24107201151.
15110270142 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 344908 + ... + 386240.
It is an arithmetic number, because the mean of its divisors is an integer number (535688640).
Almost surely, 215110270142 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 15110270142, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17142036480).
15110270142 is an abundant number, since it is smaller than the sum of its proper divisors (19173802818).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15110270142 is a wasteful number, since it uses less digits than its factorization.
15110270142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41569.
The product of its (nonzero) digits is 560, while the sum is 24.
Adding to 15110270142 its reverse (24107201151), we get a palindrome (39217471293).
The spelling of 15110270142 in words is "fifteen billion, one hundred ten million, two hundred seventy thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •