Base | Representation |
---|---|
bin | 100010011100110101011101… |
… | …110000111100010100010100 |
3 | 201212110201001020011201111211 |
4 | 202130311131300330110110 |
5 | 124324410443402141202 |
6 | 1254125031500511204 |
7 | 43625415163566265 |
oct | 4234653560742424 |
9 | 655421036151454 |
10 | 151515134412052 |
11 | 44306231425404 |
12 | 14bb0793b4b504 |
13 | 6670a7b600308 |
14 | 295b52ba9896c |
15 | 127b3ca2de1d7 |
hex | 89cd5dc3c514 |
151515134412052 has 24 divisors (see below), whose sum is σ = 270833444269920. Its totient is φ = 74145463345440.
The previous prime is 151515134412043. The next prime is 151515134412137. The reversal of 151515134412052 is 250214431515151.
It is a junction number, because it is equal to n+sod(n) for n = 151515134411996 and 151515134412014.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1414072599 + ... + 1414179742.
It is an arithmetic number, because the mean of its divisors is an integer number (11284726844580).
Almost surely, 2151515134412052 is an apocalyptic number.
It is an amenable number.
151515134412052 is a deficient number, since it is larger than the sum of its proper divisors (119318309857868).
151515134412052 is a wasteful number, since it uses less digits than its factorization.
151515134412052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2828252631 (or 2828252629 counting only the distinct ones).
The product of its (nonzero) digits is 120000, while the sum is 40.
The spelling of 151515134412052 in words is "one hundred fifty-one trillion, five hundred fifteen billion, one hundred thirty-four million, four hundred twelve thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •