Base | Representation |
---|---|
bin | 11110101110000010000… |
… | …10001001111001101011 |
3 | 10201220102222220202211020 |
4 | 33113001002021321223 |
5 | 114243133410230201 |
6 | 2124520443103523 |
7 | 136154261120463 |
oct | 17270102117153 |
9 | 3656388822736 |
10 | 1055505555051 |
11 | 377701406a42 |
12 | 150692811ba3 |
13 | 786c284583c |
14 | 39130038ba3 |
15 | 1c6c9626a36 |
hex | f5c1089e6b |
1055505555051 has 8 divisors (see below), whose sum is σ = 1407355461264. Its totient is φ = 703663009440.
The previous prime is 1055505555017. The next prime is 1055505555073. The reversal of 1055505555051 is 1505555055501.
1055505555051 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1055505555051 - 234 = 1038325685867 is a prime.
It is a super-2 number, since 2×10555055550512 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1055505554994 and 1055505555012.
It is not an unprimeable number, because it can be changed into a prime (1055505555011) 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, 1496376 + ... + 2085701.
It is an arithmetic number, because the mean of its divisors is an integer number (175919432658).
Almost surely, 21055505555051 is an apocalyptic number.
1055505555051 is a deficient number, since it is larger than the sum of its proper divisors (351849906213).
1055505555051 is an equidigital number, since it uses as much as digits as its factorization.
1055505555051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3680301.
The product of its (nonzero) digits is 390625, while the sum is 42.
The spelling of 1055505555051 in words is "one trillion, fifty-five billion, five hundred five million, five hundred fifty-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •