Base | Representation |
---|---|
bin | 11000000111011000100010… |
… | …101110100110101111001000 |
3 | 111220112021200221210002100210 |
4 | 120013120202232212233020 |
5 | 102400143403243100211 |
6 | 1013323305015001120 |
7 | 31224422121120324 |
oct | 3007304256465710 |
9 | 456467627702323 |
10 | 106060505050056 |
11 | 3088100a122227 |
12 | ba8b2a06691a0 |
13 | 47246027657bb |
14 | 1c294da5a2984 |
15 | c3dd254be9a6 |
hex | 607622ba6bc8 |
106060505050056 has 64 divisors (see below), whose sum is σ = 273300609314880. Its totient is φ = 34273821047040.
The previous prime is 106060505050033. The next prime is 106060505050061. The reversal of 106060505050056 is 650050505060601.
106060505050056 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1060605050500562 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106060505049996 and 106060505050023.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 215345190 + ... + 215837141.
It is an arithmetic number, because the mean of its divisors is an integer number (4270322020545).
Almost surely, 2106060505050056 is an apocalyptic number.
It is an amenable number.
106060505050056 is an abundant number, since it is smaller than the sum of its proper divisors (167240104264824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106060505050056 is a wasteful number, since it uses less digits than its factorization.
106060505050056 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 431182654 (or 431182650 counting only the distinct ones).
The product of its (nonzero) digits is 135000, while the sum is 39.
The spelling of 106060505050056 in words is "one hundred six trillion, sixty billion, five hundred five million, fifty thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •