Base | Representation |
---|---|
bin | 11000011101001111111001… |
… | …110101001110101000010110 |
3 | 112002211221001102020210121002 |
4 | 120131033321311032220112 |
5 | 103044303120203132240 |
6 | 1020433441512023302 |
7 | 31441113560026322 |
oct | 3035177165165026 |
9 | 462757042223532 |
10 | 107563057474070 |
11 | 31300266865550 |
12 | 10092536391b32 |
13 | 48031ca905073 |
14 | 1c7c118c08982 |
15 | c67e6699cd15 |
hex | 61d3f9d4ea16 |
107563057474070 has 64 divisors (see below), whose sum is σ = 214076029764672. Its totient is φ = 38586765120000.
The previous prime is 107563057474063. The next prime is 107563057474091. The reversal of 107563057474070 is 70474750365701.
107563057474070 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×1075630574740702 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 107563057473997 and 107563057474015.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 14398421 + ... + 20553360.
It is an arithmetic number, because the mean of its divisors is an integer number (3344937965073).
Almost surely, 2107563057474070 is an apocalyptic number.
107563057474070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
107563057474070 is a deficient number, since it is larger than the sum of its proper divisors (106512972290602).
107563057474070 is a wasteful number, since it uses less digits than its factorization.
107563057474070 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34952177.
The product of its (nonzero) digits is 17287200, while the sum is 56.
The spelling of 107563057474070 in words is "one hundred seven trillion, five hundred sixty-three billion, fifty-seven million, four hundred seventy-four thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •