Base | Representation |
---|---|
bin | 110001100011011100… |
… | …0111100110101110100 |
3 | 101011200022112121002202 |
4 | 1203012320330311310 |
5 | 3220420001030030 |
6 | 120515320524032 |
7 | 10455042233324 |
oct | 1430670746564 |
9 | 334608477082 |
10 | 106416033140 |
11 | 4114909282a |
12 | 1875a620618 |
13 | a05bb41761 |
14 | 5217209284 |
15 | 2b7c651745 |
hex | 18c6e3cd74 |
106416033140 has 24 divisors (see below), whose sum is σ = 224192247552. Its totient is φ = 42429541280.
The previous prime is 106416033089. The next prime is 106416033151. The reversal of 106416033140 is 41330614601.
106416033140 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×1064160331402 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
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, 8548124 + ... + 8560563.
It is an arithmetic number, because the mean of its divisors is an integer number (9341343648).
Almost surely, 2106416033140 is an apocalyptic number.
106416033140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106416033140 is an abundant number, since it is smaller than the sum of its proper divisors (117776214412).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106416033140 is a wasteful number, since it uses less digits than its factorization.
106416033140 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17109007 (or 17109005 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 29.
Adding to 106416033140 its reverse (41330614601), we get a palindrome (147746647741).
The spelling of 106416033140 in words is "one hundred six billion, four hundred sixteen million, thirty-three thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •