Base | Representation |
---|---|
bin | 10010100110110… |
… | …00000000011101 |
3 | 101212200101022000 |
4 | 21103120000131 |
5 | 304423332023 |
6 | 23253112513 |
7 | 3603415164 |
oct | 1123300035 |
9 | 355611260 |
10 | 156074013 |
11 | 80110797 |
12 | 44328739 |
13 | 264477b4 |
14 | 16a2a3db |
15 | da7e243 |
hex | 94d801d |
156074013 has 8 divisors (see below), whose sum is σ = 231220800. Its totient is φ = 104049324.
The previous prime is 156074011. The next prime is 156074063. The reversal of 156074013 is 310470651.
156074013 is a `hidden beast` number, since 1 + 5 + 607 + 40 + 13 = 666.
It is not a de Polignac number, because 156074013 - 21 = 156074011 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 5780519 = 156074013 / (1 + 5 + 6 + 0 + 7 + 4 + 0 + 1 + 3).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (156074011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2890233 + ... + 2890286.
It is an arithmetic number, because the mean of its divisors is an integer number (28902600).
Almost surely, 2156074013 is an apocalyptic number.
It is an amenable number.
156074013 is a deficient number, since it is larger than the sum of its proper divisors (75146787).
156074013 is an equidigital number, since it uses as much as digits as its factorization.
156074013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5780528 (or 5780522 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 27.
The square root of 156074013 is about 12492.9585367118. The cubic root of 156074013 is about 538.4063818757.
The spelling of 156074013 in words is "one hundred fifty-six million, seventy-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •