Base | Representation |
---|---|
bin | 111110111000100100101000… |
… | …1111010010001001111100111 |
3 | 2200112111000001001221221001212 |
4 | 1331301021101322101033213 |
5 | 1040000012422244142020 |
6 | 5240225450200542035 |
7 | 224336354120606150 |
oct | 17561112172211747 |
9 | 2615430031857055 |
10 | 553133032412135 |
11 | 15027744671489a |
12 | 52054a7948191b |
13 | 1a9842b4b10796 |
14 | 9a83ad2a68927 |
15 | 43e33d5e5ccc5 |
hex | 1f71251e913e7 |
553133032412135 has 8 divisors (see below), whose sum is σ = 758582444450976. Its totient is φ = 379291222225440.
The previous prime is 553133032412117. The next prime is 553133032412137. The reversal of 553133032412135 is 531214230331355.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 553133032412135 - 240 = 552033520784359 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 553133032412092 and 553133032412101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (553133032412137) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7901900462996 + ... + 7901900463065.
It is an arithmetic number, because the mean of its divisors is an integer number (94822805556372).
Almost surely, 2553133032412135 is an apocalyptic number.
553133032412135 is a deficient number, since it is larger than the sum of its proper divisors (205449412038841).
553133032412135 is a wasteful number, since it uses less digits than its factorization.
553133032412135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15803800926073.
The product of its (nonzero) digits is 486000, while the sum is 41.
The spelling of 553133032412135 in words is "five hundred fifty-three trillion, one hundred thirty-three billion, thirty-two million, four hundred twelve thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •