Base | Representation |
---|---|
bin | 11110101110011001010… |
… | …11111011100010100011 |
3 | 10201220221121210020020012 |
4 | 33113030223323202203 |
5 | 114244033432240101 |
6 | 2124552105235135 |
7 | 136162153625204 |
oct | 17271453734243 |
9 | 3656847706205 |
10 | 1055701055651 |
11 | 3777a17a6490 |
12 | 150728192aab |
13 | 787241b5b78 |
14 | 3914bda95ab |
15 | 1c6db892bbb |
hex | f5ccafb8a3 |
1055701055651 has 8 divisors (see below), whose sum is σ = 1151685869808. Its totient is φ = 959718240000.
The previous prime is 1055701055611. The next prime is 1055701055657. The reversal of 1055701055651 is 1565501075501.
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 1055701055651 - 26 = 1055701055587 is a prime.
It is a super-2 number, since 2×10557010556512 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1055701055599 and 1055701055608.
It is not an unprimeable number, because it can be changed into a prime (1055701055657) 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, 738251 + ... + 1629851.
It is an arithmetic number, because the mean of its divisors is an integer number (143960733726).
Almost surely, 21055701055651 is an apocalyptic number.
1055701055651 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1055701055651 is a deficient number, since it is larger than the sum of its proper divisors (95984814157).
1055701055651 is a wasteful number, since it uses less digits than its factorization.
1055701055651 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 999253.
The product of its (nonzero) digits is 131250, while the sum is 41.
The spelling of 1055701055651 in words is "one trillion, fifty-five billion, seven hundred one million, fifty-five thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.234 sec. • engine limits •