Base | Representation |
---|---|
bin | 10010100111001… |
… | …00100010000000 |
3 | 101212202222122222 |
4 | 21103210202000 |
5 | 304432002222 |
6 | 23254150212 |
7 | 3604020560 |
oct | 1123444200 |
9 | 355688588 |
10 | 156125312 |
11 | 80146292 |
12 | 44352368 |
13 | 26464c55 |
14 | 16a40da0 |
15 | da8e542 |
hex | 94e4880 |
156125312 has 64 divisors (see below), whose sum is σ = 357979200. Its totient is φ = 66438144.
The previous prime is 156125309. The next prime is 156125327. The reversal of 156125312 is 213521651.
It is a tau number, because it is divible by the number of its divisors (64).
It is a super-2 number, since 2×1561253122 = 48750226094194688, which contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 145514 + ... + 146582.
It is an arithmetic number, because the mean of its divisors is an integer number (5593425).
Almost surely, 2156125312 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 156125312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (178989600).
156125312 is an abundant number, since it is smaller than the sum of its proper divisors (201853888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
156125312 is a wasteful number, since it uses less digits than its factorization.
156125312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1253 (or 1241 counting only the distinct ones).
The product of its digits is 1800, while the sum is 26.
The square root of 156125312 is about 12495.0114845886. The cubic root of 156125312 is about 538.4653638996.
Adding to 156125312 its reverse (213521651), we get a palindrome (369646963).
The spelling of 156125312 in words is "one hundred fifty-six million, one hundred twenty-five thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •