Base | Representation |
---|---|
bin | 10100011101100100110… |
… | …101111011110110001001 |
3 | 11222102111202002101102022 |
4 | 110131210311323312021 |
5 | 141014241404304103 |
6 | 2553550304214225 |
7 | 203406420126551 |
oct | 24354465736611 |
9 | 4872452071368 |
10 | 1406146166153 |
11 | 4a2385941953 |
12 | 1a862b60a375 |
13 | a27a305b791 |
14 | 4c0b49c6161 |
15 | 2689ca1b138 |
hex | 14764d7bd89 |
1406146166153 has 6 divisors (see below), whose sum is σ = 1430383104474. Its totient is φ = 1382313176864.
The previous prime is 1406146166149. The next prime is 1406146166197. The reversal of 1406146166153 is 3516616416041.
It can be written as a sum of positive squares in only one way, i.e., 1067518771264 + 338627394889 = 1033208^2 + 581917^2 .
It is not a de Polignac number, because 1406146166153 - 22 = 1406146166149 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1406146966153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 201970976 + ... + 201977937.
It is an arithmetic number, because the mean of its divisors is an integer number (238397184079).
Almost surely, 21406146166153 is an apocalyptic number.
It is an amenable number.
1406146166153 is a deficient number, since it is larger than the sum of its proper divisors (24236938321).
1406146166153 is an frugal number, since it uses more digits than its factorization.
1406146166153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 403949031 (or 403948972 counting only the distinct ones).
The product of its (nonzero) digits is 311040, while the sum is 44.
The spelling of 1406146166153 in words is "one trillion, four hundred six billion, one hundred forty-six million, one hundred sixty-six thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •