Base | Representation |
---|---|
bin | 1000110011100001111… |
… | …0000001010011110111 |
3 | 112110110100112122212011 |
4 | 2030320132001103313 |
5 | 4434300414433033 |
6 | 153254255505051 |
7 | 13633433254660 |
oct | 2147036012367 |
9 | 473410478764 |
10 | 151271249143 |
11 | 59176749483 |
12 | 25398528187 |
13 | 11359a5bba1 |
14 | 747054a367 |
15 | 3e054e0ccd |
hex | 23387814f7 |
151271249143 has 16 divisors (see below), whose sum is σ = 180563304960. Its totient is φ = 124018455456.
The previous prime is 151271249131. The next prime is 151271249177. The reversal of 151271249143 is 341942172151.
It is a happy number.
151271249143 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 151271249143 - 25 = 151271249111 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 151271249096 and 151271249105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (151271249543) 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 15 ways as a sum of consecutive naturals, for example, 4934371 + ... + 4964932.
It is an arithmetic number, because the mean of its divisors is an integer number (11285206560).
Almost surely, 2151271249143 is an apocalyptic number.
151271249143 is a deficient number, since it is larger than the sum of its proper divisors (29292055817).
151271249143 is an equidigital number, since it uses as much as digits as its factorization.
151271249143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9899406.
The product of its digits is 60480, while the sum is 40.
The spelling of 151271249143 in words is "one hundred fifty-one billion, two hundred seventy-one million, two hundred forty-nine thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •