Base | Representation |
---|---|
bin | 10110100110011101001… |
… | …011011000010101100011 |
3 | 12111110212121122220010200 |
4 | 112212131023120111203 |
5 | 200421242232400120 |
6 | 3145254340000243 |
7 | 220131523610265 |
oct | 26463513302543 |
9 | 5443777586120 |
10 | 1553120200035 |
11 | 549746954958 |
12 | 211008990083 |
13 | b35c6734831 |
14 | 55258531b35 |
15 | 2a600b27e90 |
hex | 1699d2d8563 |
1553120200035 has 12 divisors (see below), whose sum is σ = 2692075013472. Its totient is φ = 828330773328.
The previous prime is 1553120200031. The next prime is 1553120200063. The reversal of 1553120200035 is 5300020213551.
It is a happy number.
It is not a de Polignac number, because 1553120200035 - 22 = 1553120200031 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1553120199981 and 1553120200008.
It is not an unprimeable number, because it can be changed into a prime (1553120200031) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 17256891067 + ... + 17256891156.
It is an arithmetic number, because the mean of its divisors is an integer number (224339584456).
Almost surely, 21553120200035 is an apocalyptic number.
1553120200035 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1553120200035 is a deficient number, since it is larger than the sum of its proper divisors (1138954813437).
1553120200035 is a wasteful number, since it uses less digits than its factorization.
1553120200035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34513782234 (or 34513782231 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 27.
Adding to 1553120200035 its reverse (5300020213551), we get a palindrome (6853140413586).
The spelling of 1553120200035 in words is "one trillion, five hundred fifty-three billion, one hundred twenty million, two hundred thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •