Base | Representation |
---|---|
bin | 1001000101101100001… |
… | …1010011001001000111 |
3 | 112221001010000201000010 |
4 | 2101123003103021013 |
5 | 10024241440223101 |
6 | 155422131321303 |
7 | 14165311423020 |
oct | 2213303231107 |
9 | 487033021003 |
10 | 156146414151 |
11 | 60248642072 |
12 | 26319150233 |
13 | 11955a8cc00 |
14 | 77b3bd3c47 |
15 | 40dd4d92d6 |
hex | 245b0d3247 |
156146414151 has 96 divisors (see below), whose sum is σ = 265143470592. Its totient is φ = 79988912640.
The previous prime is 156146414147. The next prime is 156146414153. The reversal of 156146414151 is 151414641651.
It is not a de Polignac number, because 156146414151 - 22 = 156146414147 is a prime.
It is a super-2 number, since 2×1561464141512 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (156146414153) 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 95 ways as a sum of consecutive naturals, for example, 27619041 + ... + 27624693.
It is an arithmetic number, because the mean of its divisors is an integer number (2761911152).
Almost surely, 2156146414151 is an apocalyptic number.
156146414151 is a deficient number, since it is larger than the sum of its proper divisors (108997056441).
156146414151 is a wasteful number, since it uses less digits than its factorization.
156146414151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5913 (or 5900 counting only the distinct ones).
The product of its digits is 57600, while the sum is 39.
The spelling of 156146414151 in words is "one hundred fifty-six billion, one hundred forty-six million, four hundred fourteen thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •