Base | Representation |
---|---|
bin | 10101000010110100111… |
… | …110101011011001110101 |
3 | 12010020202100121000002020 |
4 | 111002310332223121311 |
5 | 142143201201403140 |
6 | 3024203333303353 |
7 | 206323554403026 |
oct | 25026476533165 |
9 | 5106670530066 |
10 | 1446145341045 |
11 | 508341386a89 |
12 | 1b4333194b59 |
13 | a64a8bb25c2 |
14 | 4ddcb01ac4d |
15 | 2793e3dd6d0 |
hex | 150b4fab675 |
1446145341045 has 32 divisors (see below), whose sum is σ = 2324126068992. Its totient is φ = 767847378432.
The previous prime is 1446145341013. The next prime is 1446145341049. The reversal of 1446145341045 is 5401435416441.
It is not a de Polignac number, because 1446145341045 - 25 = 1446145341013 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1446145340988 and 1446145341006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1446145341049) 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 31 ways as a sum of consecutive naturals, for example, 25159759 + ... + 25217171.
It is an arithmetic number, because the mean of its divisors is an integer number (72628939656).
Almost surely, 21446145341045 is an apocalyptic number.
1446145341045 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1446145341045 is a deficient number, since it is larger than the sum of its proper divisors (877980727947).
1446145341045 is a wasteful number, since it uses less digits than its factorization.
1446145341045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64861.
The product of its (nonzero) digits is 460800, while the sum is 42.
The spelling of 1446145341045 in words is "one trillion, four hundred forty-six billion, one hundred forty-five million, three hundred forty-one thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •