Base | Representation |
---|---|
bin | 1001000110000101000… |
… | …0100101101001111010 |
3 | 112221022100222220211020 |
4 | 2101201100211221322 |
5 | 10030000120424041 |
6 | 155440331443310 |
7 | 14201014566411 |
oct | 2214120455172 |
9 | 487270886736 |
10 | 156250561146 |
11 | 602a1406269 |
12 | 26347bb6536 |
13 | 11971526154 |
14 | 77c3984478 |
15 | 40e770c866 |
hex | 2461425a7a |
156250561146 has 8 divisors (see below), whose sum is σ = 312501122304. Its totient is φ = 52083520380.
The previous prime is 156250561141. The next prime is 156250561147. The reversal of 156250561146 is 641165052651.
It is a sphenic number, since it is the product of 3 distinct primes.
156250561146 is an admirable number.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 156250561098 and 156250561107.
It is not an unprimeable number, because it can be changed into a prime (156250561141) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13020880090 + ... + 13020880101.
It is an arithmetic number, because the mean of its divisors is an integer number (39062640288).
Almost surely, 2156250561146 is an apocalyptic number.
156250561146 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
156250561146 is a wasteful number, since it uses less digits than its factorization.
156250561146 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26041760196.
The product of its (nonzero) digits is 216000, while the sum is 42.
The spelling of 156250561146 in words is "one hundred fifty-six billion, two hundred fifty million, five hundred sixty-one thousand, one hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •