Base | Representation |
---|---|
bin | 11110101101010010001… |
… | …00001001101101000001 |
3 | 10201212101222020110120102 |
4 | 33112221010021231001 |
5 | 114241322434102340 |
6 | 2124412520052145 |
7 | 136141306065614 |
oct | 17265104115501 |
9 | 3655358213512 |
10 | 1055103425345 |
11 | 377515416a42 |
12 | 1505a0004055 |
13 | 7865a439a78 |
14 | 390d287c17b |
15 | 1c6a4192215 |
hex | f5a9109b41 |
1055103425345 has 8 divisors (see below), whose sum is σ = 1269048187176. Its totient is φ = 842133355776.
The previous prime is 1055103425339. The next prime is 1055103425393. The reversal of 1055103425345 is 5435243015501.
It can be written as a sum of positive squares in 4 ways, for example, as 3100373761 + 1052003051584 = 55681^2 + 1025672^2 .
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 1055103425345 - 216 = 1055103359809 is a prime.
It is a super-2 number, since 2×10551034253452 (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 = 1055103425299 and 1055103425308.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 243670682 + ... + 243675011.
It is an arithmetic number, because the mean of its divisors is an integer number (158631023397).
Almost surely, 21055103425345 is an apocalyptic number.
It is an amenable number.
1055103425345 is a deficient number, since it is larger than the sum of its proper divisors (213944761831).
1055103425345 is an equidigital number, since it uses as much as digits as its factorization.
1055103425345 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 487346131.
The product of its (nonzero) digits is 180000, while the sum is 38.
The spelling of 1055103425345 in words is "one trillion, fifty-five billion, one hundred three million, four hundred twenty-five thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.300 sec. • engine limits •