Base | Representation |
---|---|
bin | 1000110111111001010… |
… | …1111110100111000011 |
3 | 112120111001102111220011 |
4 | 2031332111332213003 |
5 | 4444201021433201 |
6 | 154010454125351 |
7 | 14004456522136 |
oct | 2157625764703 |
9 | 476431374804 |
10 | 152443546051 |
11 | 597184534a5 |
12 | 25665050857 |
13 | 114b58a39b4 |
14 | 754210821d |
15 | 3e733a8151 |
hex | 237e57e9c3 |
152443546051 has 12 divisors (see below), whose sum is σ = 160982247504. Its totient is φ = 144336654000.
The previous prime is 152443546037. The next prime is 152443546061. The reversal of 152443546051 is 150645344251.
It is not a de Polignac number, because 152443546051 - 211 = 152443544003 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 152443545995 and 152443546013.
It is not an unprimeable number, because it can be changed into a prime (152443546061) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 507226 + ... + 749776.
It is an arithmetic number, because the mean of its divisors is an integer number (13415187292).
Almost surely, 2152443546051 is an apocalyptic number.
152443546051 is a deficient number, since it is larger than the sum of its proper divisors (8538701453).
152443546051 is a wasteful number, since it uses less digits than its factorization.
152443546051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 244330 (or 244311 counting only the distinct ones).
The product of its (nonzero) digits is 288000, while the sum is 40.
The spelling of 152443546051 in words is "one hundred fifty-two billion, four hundred forty-three million, five hundred forty-six thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •