Base | Representation |
---|---|
bin | 10101010101001010010… |
… | …010010000101011110101 |
3 | 12012010120020000211221002 |
4 | 111111022102100223311 |
5 | 143004010004230403 |
6 | 3041220523133045 |
7 | 210621431454200 |
oct | 25251222205365 |
9 | 5163506024832 |
10 | 1465830148853 |
11 | 5157229a5494 |
12 | 1b8107674185 |
13 | a82c51a0485 |
14 | 50d374d6937 |
15 | 281e2649188 |
hex | 1554a490af5 |
1465830148853 has 12 divisors (see below), whose sum is σ = 1720792935180. Its totient is φ = 1244898994752.
The previous prime is 1465830148789. The next prime is 1465830148877. The reversal of 1465830148853 is 3588410385641.
It can be written as a sum of positive squares in 2 ways, for example, as 361065186769 + 1104764962084 = 600887^2 + 1051078^2 .
It is not a de Polignac number, because 1465830148853 - 26 = 1465830148789 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1465830148883) 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 11 ways as a sum of consecutive naturals, for example, 137218976 + ... + 137229657.
It is an arithmetic number, because the mean of its divisors is an integer number (143399411265).
Almost surely, 21465830148853 is an apocalyptic number.
It is an amenable number.
1465830148853 is a deficient number, since it is larger than the sum of its proper divisors (254962786327).
1465830148853 is a wasteful number, since it uses less digits than its factorization.
1465830148853 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 274448756 (or 274448749 counting only the distinct ones).
The product of its (nonzero) digits is 11059200, while the sum is 56.
The spelling of 1465830148853 in words is "one trillion, four hundred sixty-five billion, eight hundred thirty million, one hundred forty-eight thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •