Base | Representation |
---|---|
bin | 1000110011100000011… |
… | …1001110110100000011 |
3 | 112110102221022011001202 |
4 | 2030320013032310003 |
5 | 4434242402301024 |
6 | 153253523451415 |
7 | 13633331424026 |
oct | 2147007166403 |
9 | 473387264052 |
10 | 151265275139 |
11 | 59173339090 |
12 | 25396526b6b |
13 | 11358749984 |
14 | 746d8331bd |
15 | 3e04c10bae |
hex | 23381ced03 |
151265275139 has 32 divisors (see below), whose sum is σ = 174067384320. Its totient is φ = 130109364000.
The previous prime is 151265275121. The next prime is 151265275151. The reversal of 151265275139 is 931572562151.
It is not a de Polignac number, because 151265275139 - 224 = 151248497923 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 151265275093 and 151265275102.
It is not an unprimeable number, because it can be changed into a prime (151265275169) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9122234 + ... + 9138800.
It is an arithmetic number, because the mean of its divisors is an integer number (5439605760).
Almost surely, 2151265275139 is an apocalyptic number.
151265275139 is a deficient number, since it is larger than the sum of its proper divisors (22802109181).
151265275139 is a wasteful number, since it uses less digits than its factorization.
151265275139 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16991.
The product of its digits is 567000, while the sum is 47.
The spelling of 151265275139 in words is "one hundred fifty-one billion, two hundred sixty-five million, two hundred seventy-five thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •