Base | Representation |
---|---|
bin | 11110101110000010000… |
… | …01110011010110000101 |
3 | 10201220102222202002002101 |
4 | 33113001001303112011 |
5 | 114243133344301121 |
6 | 2124520441112101 |
7 | 136154260254226 |
oct | 17270101632605 |
9 | 3656388662071 |
10 | 1055505462661 |
11 | 377701353591 |
12 | 150692788631 |
13 | 786c2812780 |
14 | 3913001324d |
15 | 1c6c9609491 |
hex | f5c1073585 |
1055505462661 has 8 divisors (see below), whose sum is σ = 1139795465984. Its totient is φ = 971657927280.
The previous prime is 1055505462643. The next prime is 1055505462667. The reversal of 1055505462661 is 1662645055501.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1055505462661 - 27 = 1055505462533 is a prime.
It is a super-2 number, since 2×10555054626612 (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 (1055505462667) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 110612025 + ... + 110621566.
It is an arithmetic number, because the mean of its divisors is an integer number (142474433248).
Almost surely, 21055505462661 is an apocalyptic number.
It is an amenable number.
1055505462661 is a deficient number, since it is larger than the sum of its proper divisors (84290003323).
1055505462661 is a wasteful number, since it uses less digits than its factorization.
1055505462661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 221233971.
The product of its (nonzero) digits is 1080000, while the sum is 46.
The spelling of 1055505462661 in words is "one trillion, fifty-five billion, five hundred five million, four hundred sixty-two thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •