Base | Representation |
---|---|
bin | 1000110010101111100… |
… | …1001001101010100011 |
3 | 112102220122112011122202 |
4 | 2030223321021222203 |
5 | 4433332411214233 |
6 | 153221321323415 |
7 | 13625262000554 |
oct | 2145371115243 |
9 | 472818464582 |
10 | 151060257443 |
11 | 59078639277 |
12 | 2533993656b |
13 | 11325126824 |
14 | 745050632b |
15 | 3de1c14be8 |
hex | 232be49aa3 |
151060257443 has 12 divisors (see below), whose sum is σ = 157323197304. Its totient is φ = 144959716800.
The previous prime is 151060257437. The next prime is 151060257493. The reversal of 151060257443 is 344752060151.
151060257443 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 151060257443 - 26 = 151060257379 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 151060257397 and 151060257406.
It is not an unprimeable number, because it can be changed into a prime (151060257433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 342521 + ... + 647642.
It is an arithmetic number, because the mean of its divisors is an integer number (13110266442).
Almost surely, 2151060257443 is an apocalyptic number.
151060257443 is a deficient number, since it is larger than the sum of its proper divisors (6262939861).
151060257443 is an frugal number, since it uses more digits than its factorization.
151060257443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 990326 (or 990265 counting only the distinct ones).
The product of its (nonzero) digits is 100800, while the sum is 38.
The spelling of 151060257443 in words is "one hundred fifty-one billion, sixty million, two hundred fifty-seven thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •