Base | Representation |
---|---|
bin | 11000010101010010100110… |
… | …101111000110101001101000 |
3 | 112000220122112011011110002001 |
4 | 120111102212233012221220 |
5 | 103011323140320404000 |
6 | 1015334321552220344 |
7 | 31353444155404624 |
oct | 3025224657065150 |
9 | 460818464143061 |
10 | 107016202513000 |
11 | 3110a353459330 |
12 | 1000455983a6b4 |
13 | 479377a481871 |
14 | 1c5d87cc54184 |
15 | c58b0c66846a |
hex | 6154a6bc6a68 |
107016202513000 has 128 divisors (see below), whose sum is σ = 278995588185600. Its totient is φ = 38087004192000.
The previous prime is 107016202512979. The next prime is 107016202513027. The reversal of 107016202513000 is 315202610701.
It is a happy number.
It is a super-2 number, since 2×1070162025130002 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 107016202513000.
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, 102980295 + ... + 104014294.
It is an arithmetic number, because the mean of its divisors is an integer number (2179653032700).
Almost surely, 2107016202513000 is an apocalyptic number.
107016202513000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
107016202513000 is an abundant number, since it is smaller than the sum of its proper divisors (171979385672600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107016202513000 is a wasteful number, since it uses less digits than its factorization.
107016202513000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 206994668 (or 206994654 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 28.
The spelling of 107016202513000 in words is "one hundred seven trillion, sixteen billion, two hundred two million, five hundred thirteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •