Base | Representation |
---|---|
bin | 11110101101111001011… |
… | …10001001011000110101 |
3 | 10201220020221202211000011 |
4 | 33112330232021120311 |
5 | 114243011344414310 |
6 | 2124505340220221 |
7 | 136152422121355 |
oct | 17267456113065 |
9 | 3656227684004 |
10 | 1055433201205 |
11 | 377674588479 |
12 | 15067253a671 |
13 | 786b0861806 |
14 | 391245a2b65 |
15 | 1c6c30d378a |
hex | f5bcb89635 |
1055433201205 has 16 divisors (see below), whose sum is σ = 1308591345024. Its totient is φ = 816747655360.
The previous prime is 1055433201203. The next prime is 1055433201209. The reversal of 1055433201205 is 5021023345501.
It is not a de Polignac number, because 1055433201205 - 21 = 1055433201203 is a prime.
It is a super-2 number, since 2×10554332012052 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1055433201203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 28028839 + ... + 28066468.
It is an arithmetic number, because the mean of its divisors is an integer number (81786959064).
Almost surely, 21055433201205 is an apocalyptic number.
It is an amenable number.
1055433201205 is a deficient number, since it is larger than the sum of its proper divisors (253158143819).
1055433201205 is an equidigital number, since it uses as much as digits as its factorization.
1055433201205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56095436.
The product of its (nonzero) digits is 18000, while the sum is 31.
Adding to 1055433201205 its reverse (5021023345501), we get a palindrome (6076456546706).
The spelling of 1055433201205 in words is "one trillion, fifty-five billion, four hundred thirty-three million, two hundred one thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •