Base | Representation |
---|---|
bin | 1001000101001111101… |
… | …0011101010111010100 |
3 | 112220201202200100222220 |
4 | 2101103322131113110 |
5 | 10024020310444322 |
6 | 155402212422340 |
7 | 14162325460350 |
oct | 2212372352724 |
9 | 486652610886 |
10 | 156026656212 |
11 | 60196a86169 |
12 | 262a50179b0 |
13 | 1193701c21b |
14 | 77a1d3c460 |
15 | 40d2c3055c |
hex | 2453e9d5d4 |
156026656212 has 48 divisors (see below), whose sum is σ = 416155041792. Its totient is φ = 44570049120.
The previous prime is 156026656211. The next prime is 156026656229. The reversal of 156026656212 is 212656620651.
It is a happy number.
156026656212 is digitally balanced in base 7, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (156026656211) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 237037 + ... + 606827.
It is an arithmetic number, because the mean of its divisors is an integer number (8669896704).
Almost surely, 2156026656212 is an apocalyptic number.
156026656212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
156026656212 is an abundant number, since it is smaller than the sum of its proper divisors (260128385580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
156026656212 is a wasteful number, since it uses less digits than its factorization.
156026656212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 374828 (or 374826 counting only the distinct ones).
The product of its (nonzero) digits is 259200, while the sum is 42.
The spelling of 156026656212 in words is "one hundred fifty-six billion, twenty-six million, six hundred fifty-six thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •