Base | Representation |
---|---|
bin | 1001000110101000111… |
… | …0100000110110111000 |
3 | 112221200212002121210201 |
4 | 2101222032200312320 |
5 | 10030302124342102 |
6 | 155503304251544 |
7 | 14204522445160 |
oct | 2215216406670 |
9 | 487625077721 |
10 | 156401012152 |
11 | 60369326340 |
12 | 2638a470bb4 |
13 | 11996752408 |
14 | 77d99495a0 |
15 | 4105a2a987 |
hex | 246a3a0db8 |
156401012152 has 64 divisors (see below), whose sum is σ = 370017849600. Its totient is φ = 60201277440.
The previous prime is 156401012149. The next prime is 156401012177. The reversal of 156401012152 is 251210104651.
It is a super-2 number, since 2×1564010121522 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a self number, because there is not a number n which added to its sum of digits gives 156401012152.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 1478377 + ... + 1580632.
It is an arithmetic number, because the mean of its divisors is an integer number (5781528900).
Almost surely, 2156401012152 is an apocalyptic number.
It is an amenable number.
156401012152 is an abundant number, since it is smaller than the sum of its proper divisors (213616837448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
156401012152 is a wasteful number, since it uses less digits than its factorization.
156401012152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3059116 (or 3059112 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 28.
The spelling of 156401012152 in words is "one hundred fifty-six billion, four hundred one million, twelve thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •