Base | Representation |
---|---|
bin | 110001010111010110… |
… | …0100111000101110100 |
3 | 101010122000210100102212 |
4 | 1202232230213011310 |
5 | 3214102044121030 |
6 | 120411141152552 |
7 | 10442013236354 |
oct | 1425654470564 |
9 | 333560710385 |
10 | 106010145140 |
11 | 40a5aa660a9 |
12 | 186666bb758 |
13 | 9cc5a1b143 |
14 | 51b9350b64 |
15 | 2b56bc8595 |
hex | 18aeb27174 |
106010145140 has 24 divisors (see below), whose sum is σ = 224701882272. Its totient is φ = 42007757600.
The previous prime is 106010145121. The next prime is 106010145167. The reversal of 106010145140 is 41541010601.
It is a happy number.
It is a super-2 number, since 2×1060101451402 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 24766586 + ... + 24770865.
It is an arithmetic number, because the mean of its divisors is an integer number (9362578428).
Almost surely, 2106010145140 is an apocalyptic number.
106010145140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106010145140 is an abundant number, since it is smaller than the sum of its proper divisors (118691737132).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106010145140 is a wasteful number, since it uses less digits than its factorization.
106010145140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49537567 (or 49537565 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 23.
Adding to 106010145140 its reverse (41541010601), we get a palindrome (147551155741).
The spelling of 106010145140 in words is "one hundred six billion, ten million, one hundred forty-five thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •