Base | Representation |
---|---|
bin | 10110100110110100101… |
… | …011100100101001101100 |
3 | 12111111220002122011122120 |
4 | 112212310223210221230 |
5 | 200423044203440202 |
6 | 3145401423312540 |
7 | 220144352333613 |
oct | 26466453445154 |
9 | 5444802564576 |
10 | 1553514515052 |
11 | 549929497635 |
12 | 2110b8a4b750 |
13 | b365a335626 |
14 | 55294a5687a |
15 | 2a6255670bc |
hex | 169b4ae4a6c |
1553514515052 has 12 divisors (see below), whose sum is σ = 3624867201816. Its totient is φ = 517838171680.
The previous prime is 1553514515041. The next prime is 1553514515057. The reversal of 1553514515052 is 2505154153551.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 1553514514995 and 1553514515013.
It is not an unprimeable number, because it can be changed into a prime (1553514515057) 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, 64729771449 + ... + 64729771472.
It is an arithmetic number, because the mean of its divisors is an integer number (302072266818).
Almost surely, 21553514515052 is an apocalyptic number.
1553514515052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1553514515052 is an abundant number, since it is smaller than the sum of its proper divisors (2071352686764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1553514515052 is a wasteful number, since it uses less digits than its factorization.
1553514515052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129459542928 (or 129459542926 counting only the distinct ones).
The product of its (nonzero) digits is 375000, while the sum is 42.
The spelling of 1553514515052 in words is "one trillion, five hundred fifty-three billion, five hundred fourteen million, five hundred fifteen thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •