Base | Representation |
---|---|
bin | 110001011010101111… |
… | …1000110000000010100 |
3 | 101010220222002220220201 |
4 | 1202311133012000110 |
5 | 3214320223323020 |
6 | 120430330310244 |
7 | 10444565322055 |
oct | 1426537060024 |
9 | 333828086821 |
10 | 106124042260 |
11 | 41009289755 |
12 | 18698888384 |
13 | a0134b92a2 |
14 | 51ca51c72c |
15 | 2b61bc5a0a |
hex | 18b57c6014 |
106124042260 has 96 divisors (see below), whose sum is σ = 229377318912. Its totient is φ = 41226232320.
The previous prime is 106124042201. The next prime is 106124042267. The reversal of 106124042260 is 62240421601.
It is a super-3 number, since 3×1061240422603 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106124042267) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 100022130 + ... + 100023190.
It is an arithmetic number, because the mean of its divisors is an integer number (2389347072).
Almost surely, 2106124042260 is an apocalyptic number.
106124042260 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106124042260 is an abundant number, since it is smaller than the sum of its proper divisors (123253276652).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106124042260 is a wasteful number, since it uses less digits than its factorization.
106124042260 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1993 (or 1991 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 106124042260 its reverse (62240421601), we get a palindrome (168364463861).
The spelling of 106124042260 in words is "one hundred six billion, one hundred twenty-four million, forty-two thousand, two hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •