Base | Representation |
---|---|
bin | 100010010101110101011011… |
… | …001010111010001001101101 |
3 | 201210202201021221112121102212 |
4 | 202111311123022322021231 |
5 | 124244020220431101000 |
6 | 1253120030425500205 |
7 | 43545564445333205 |
oct | 4225653312721155 |
9 | 653681257477385 |
10 | 151034054550125 |
11 | 4414020138675a |
12 | 14b334b3341665 |
13 | 66375b120a716 |
14 | 2942131581405 |
15 | 126db2071cc35 |
hex | 895d5b2ba26d |
151034054550125 has 8 divisors (see below), whose sum is σ = 188490500078712. Its totient is φ = 120827243640000.
The previous prime is 151034054550073. The next prime is 151034054550139. The reversal of 151034054550125 is 521055450430151.
It can be written as a sum of positive squares in 4 ways, for example, as 20782347442756 + 130251707107369 = 4558766^2 + 11412787^2 .
It is not a de Polignac number, because 151034054550125 - 28 = 151034054549869 is a prime.
It is a super-2 number, since 2×1510340545501252 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 604136218076 + ... + 604136218325.
It is an arithmetic number, because the mean of its divisors is an integer number (23561312509839).
Almost surely, 2151034054550125 is an apocalyptic number.
It is an amenable number.
151034054550125 is a deficient number, since it is larger than the sum of its proper divisors (37456445528587).
151034054550125 is an equidigital number, since it uses as much as digits as its factorization.
151034054550125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1208272436416 (or 1208272436406 counting only the distinct ones).
The product of its (nonzero) digits is 300000, while the sum is 41.
The spelling of 151034054550125 in words is "one hundred fifty-one trillion, thirty-four billion, fifty-four million, five hundred fifty thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •