Base | Representation |
---|---|
bin | 1001000110010011111… |
… | …1010110010101010111 |
3 | 112221110201202210200211 |
4 | 2101210333112111113 |
5 | 10030112131311212 |
6 | 155450445150251 |
7 | 14202404600512 |
oct | 2214477262527 |
9 | 487421683624 |
10 | 156313150807 |
11 | 60323775860 |
12 | 26364b5b387 |
13 | 1198149ba58 |
14 | 77cbdd7d79 |
15 | 40ece729a7 |
hex | 2464fd6557 |
156313150807 has 16 divisors (see below), whose sum is σ = 171313833600. Its totient is φ = 141444940000.
The previous prime is 156313150789. The next prime is 156313150813. The reversal of 156313150807 is 708051313651.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-156313150807 is a prime.
It is a super-2 number, since 2×1563131508072 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 156313150807.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (156313150817) 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, 4435944 + ... + 4471042.
It is an arithmetic number, because the mean of its divisors is an integer number (10707114600).
Almost surely, 2156313150807 is an apocalyptic number.
156313150807 is a deficient number, since it is larger than the sum of its proper divisors (15000682793).
156313150807 is a wasteful number, since it uses less digits than its factorization.
156313150807 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36974.
The product of its (nonzero) digits is 75600, while the sum is 40.
The spelling of 156313150807 in words is "one hundred fifty-six billion, three hundred thirteen million, one hundred fifty thousand, eight hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •