Base | Representation |
---|---|
bin | 11100001001100111… |
… | …01100010010011111 |
3 | 1110000020212020111000 |
4 | 32010303230102133 |
5 | 221422414421101 |
6 | 10535353001343 |
7 | 1043341523061 |
oct | 160463542237 |
9 | 43006766430 |
10 | 15113045151 |
11 | 6455a13566 |
12 | 2b193b3253 |
13 | 156b0a9489 |
14 | a3524d731 |
15 | 5d6be4486 |
hex | 384cec49f |
15113045151 has 64 divisors (see below), whose sum is σ = 23955712000. Its totient is φ = 9415134144.
The previous prime is 15113045149. The next prime is 15113045153. The reversal of 15113045151 is 15154031151.
15113045151 is a `hidden beast` number, since 15 + 1 + 130 + 4 + 515 + 1 = 666.
It is an interprime number because it is at equal distance from previous prime (15113045149) and next prime (15113045153).
It is not a de Polignac number, because 15113045151 - 21 = 15113045149 is a prime.
It is a super-2 number, since 2×151130451512 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15113045153) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 14629731 + ... + 14630763.
It is an arithmetic number, because the mean of its divisors is an integer number (374308000).
Almost surely, 215113045151 is an apocalyptic number.
15113045151 is a deficient number, since it is larger than the sum of its proper divisors (8842666849).
15113045151 is an equidigital number, since it uses as much as digits as its factorization.
15113045151 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1178 (or 1134 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 27.
The spelling of 15113045151 in words is "fifteen billion, one hundred thirteen million, forty-five thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •