Base | Representation |
---|---|
bin | 11110101101000110100… |
… | …00100001101100100111 |
3 | 10201212011011221001102120 |
4 | 33112203100201230213 |
5 | 114241123014143210 |
6 | 2124355120041023 |
7 | 136136014042431 |
oct | 17264320415447 |
9 | 3655134831376 |
10 | 1055006006055 |
11 | 377475428431 |
12 | 150573463173 |
13 | 786431bab11 |
14 | 390c395d651 |
15 | 1c69a84c270 |
hex | f5a3421b27 |
1055006006055 has 64 divisors (see below), whose sum is σ = 1705170797568. Its totient is φ = 556983060480.
The previous prime is 1055006006029. The next prime is 1055006006057. The reversal of 1055006006055 is 5506006005501.
1055006006055 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 not a de Polignac number, because 1055006006055 - 216 = 1055005940519 is a prime.
It is a super-3 number, since 3×10550060060553 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1055006006057) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1197509215 + ... + 1197510095.
It is an arithmetic number, because the mean of its divisors is an integer number (26643293712).
Almost surely, 21055006006055 is an apocalyptic number.
1055006006055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1055006006055 is a deficient number, since it is larger than the sum of its proper divisors (650164791513).
1055006006055 is a wasteful number, since it uses less digits than its factorization.
1055006006055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2456.
The product of its (nonzero) digits is 22500, while the sum is 33.
The spelling of 1055006006055 in words is "one trillion, fifty-five billion, six million, six thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •