Base | Representation |
---|---|
bin | 11110101100010000100… |
… | …10000100010101000101 |
3 | 10201210222122022120020110 |
4 | 33112020102010111011 |
5 | 114234211134101341 |
6 | 2124242151423233 |
7 | 136121550133662 |
oct | 17261022042505 |
9 | 3653878276213 |
10 | 1054553425221 |
11 | 377262a0978a |
12 | 150467984b19 |
13 | 785a04c94ca |
14 | 3907d7cca69 |
15 | 1c670c4e216 |
hex | f588484545 |
1054553425221 has 16 divisors (see below), whose sum is σ = 1408324119488. Its totient is φ = 701909366400.
The previous prime is 1054553425147. The next prime is 1054553425231. The reversal of 1054553425221 is 1225243554501.
It is not a de Polignac number, because 1054553425221 - 211 = 1054553423173 is a prime.
It is a super-2 number, since 2×10545534252212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1054553425221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1054553425231) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 35919270 + ... + 35948616.
It is an arithmetic number, because the mean of its divisors is an integer number (88020257468).
Almost surely, 21054553425221 is an apocalyptic number.
It is an amenable number.
1054553425221 is a deficient number, since it is larger than the sum of its proper divisors (353770694267).
1054553425221 is a wasteful number, since it uses less digits than its factorization.
1054553425221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48132.
The product of its (nonzero) digits is 240000, while the sum is 39.
Adding to 1054553425221 its reverse (1225243554501), we get a palindrome (2279796979722).
The spelling of 1054553425221 in words is "one trillion, fifty-four billion, five hundred fifty-three million, four hundred twenty-five thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •