Base | Representation |
---|---|
bin | 10110101000001110100… |
… | …000000101101100101001 |
3 | 12111122210010012121102200 |
4 | 112220032200011230221 |
5 | 200434140443012441 |
6 | 3150211134250413 |
7 | 220226611162152 |
oct | 26501640055451 |
9 | 5448703177380 |
10 | 1555021454121 |
11 | 54a532087223 |
12 | 211459656a09 |
13 | b383a5b7155 |
14 | 55398c44929 |
15 | 2a6b29d27b6 |
hex | 16a0e805b29 |
1555021454121 has 24 divisors (see below), whose sum is σ = 2341554758400. Its totient is φ = 993306564000.
The previous prime is 1555021454101. The next prime is 1555021454159. The reversal of 1555021454121 is 1214541205551.
1555021454121 is a `hidden beast` number, since 1 + 5 + 5 + 502 + 145 + 4 + 1 + 2 + 1 = 666.
It is not a de Polignac number, because 1555021454121 - 215 = 1555021421353 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1555021454101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 27563671 + ... + 27620028.
It is an arithmetic number, because the mean of its divisors is an integer number (97564781600).
Almost surely, 21555021454121 is an apocalyptic number.
It is an amenable number.
1555021454121 is a deficient number, since it is larger than the sum of its proper divisors (786533304279).
1555021454121 is a wasteful number, since it uses less digits than its factorization.
1555021454121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55183837 (or 55183834 counting only the distinct ones).
The product of its (nonzero) digits is 40000, while the sum is 36.
Adding to 1555021454121 its reverse (1214541205551), we get a palindrome (2769562659672).
The spelling of 1555021454121 in words is "one trillion, five hundred fifty-five billion, twenty-one million, four hundred fifty-four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •