Base | Representation |
---|---|
bin | 1001000110101000111… |
… | …0100000111011001111 |
3 | 112221200212002122012001 |
4 | 2101222032200323033 |
5 | 10030302124344211 |
6 | 155503304253131 |
7 | 14204522446036 |
oct | 2215216407317 |
9 | 487625078161 |
10 | 156401012431 |
11 | 60369326574 |
12 | 2638a4711a7 |
13 | 11996752591 |
14 | 77d994971d |
15 | 4105a2aac1 |
hex | 246a3a0ecf |
156401012431 has 6 divisors (see below), whose sum is σ = 158634874496. Its totient is φ = 154198176300.
The previous prime is 156401012381. The next prime is 156401012461. The reversal of 156401012431 is 134210104651.
156401012431 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 156401012431 - 29 = 156401011919 is a prime.
It is a super-2 number, since 2×1564010124312 (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 156401012431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (156401012461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 15507855 + ... + 15517936.
Almost surely, 2156401012431 is an apocalyptic number.
156401012431 is a deficient number, since it is larger than the sum of its proper divisors (2233862065).
156401012431 is an frugal number, since it uses more digits than its factorization.
156401012431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31025933 (or 31025862 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 28.
The spelling of 156401012431 in words is "one hundred fifty-six billion, four hundred one million, twelve thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •