Base | Representation |
---|---|
bin | 10010101010010… |
… | …11010001001001 |
3 | 101220120100220111 |
4 | 21111023101021 |
5 | 310033433441 |
6 | 23311154321 |
7 | 3610422454 |
oct | 1125132111 |
9 | 356510814 |
10 | 156546121 |
11 | 80403466 |
12 | 445159a1 |
13 | 26581654 |
14 | 16b1049b |
15 | db24081 |
hex | 954b449 |
156546121 has 4 divisors (see below), whose sum is σ = 156585744. Its totient is φ = 156506500.
The previous prime is 156546097. The next prime is 156546133. The reversal of 156546121 is 121645651.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 121645651 = 61 ⋅1994191.
It is a cyclic number.
It is not a de Polignac number, because 156546121 - 27 = 156545993 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (156546151) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13135 + ... + 22036.
It is an arithmetic number, because the mean of its divisors is an integer number (39146436).
Almost surely, 2156546121 is an apocalyptic number.
It is an amenable number.
156546121 is a deficient number, since it is larger than the sum of its proper divisors (39623).
156546121 is an equidigital number, since it uses as much as digits as its factorization.
156546121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39622.
The product of its digits is 7200, while the sum is 31.
The square root of 156546121 is about 12511.8392333022. The cubic root of 156546121 is about 538.9487102440.
The spelling of 156546121 in words is "one hundred fifty-six million, five hundred forty-six thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •