Base | Representation |
---|---|
bin | 10101000011010010101… |
… | …001101011010100001101 |
3 | 12010022001001022102112020 |
4 | 111003102221223110031 |
5 | 142200211121332031 |
6 | 3024324555200353 |
7 | 206342110622235 |
oct | 25032251532415 |
9 | 5108031272466 |
10 | 1446643152141 |
11 | 508577388910 |
12 | 1b4451a460b9 |
13 | a655807c295 |
14 | 500371a2cc5 |
15 | 2796ce73096 |
hex | 150d2a6b50d |
1446643152141 has 32 divisors (see below), whose sum is σ = 2128259847168. Its totient is φ = 866760944640.
The previous prime is 1446643152133. The next prime is 1446643152173. The reversal of 1446643152141 is 1412513466441.
It is not a de Polignac number, because 1446643152141 - 23 = 1446643152133 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1446643152093 and 1446643152102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1446643152191) 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 31 ways as a sum of consecutive naturals, for example, 1632685 + ... + 2357741.
It is an arithmetic number, because the mean of its divisors is an integer number (66508120224).
Almost surely, 21446643152141 is an apocalyptic number.
1446643152141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1446643152141 is a deficient number, since it is larger than the sum of its proper divisors (681616695027).
1446643152141 is a wasteful number, since it uses less digits than its factorization.
1446643152141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 725761.
The product of its digits is 276480, while the sum is 42.
The spelling of 1446643152141 in words is "one trillion, four hundred forty-six billion, six hundred forty-three million, one hundred fifty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •