Base | Representation |
---|---|
bin | 110001011000000000… |
… | …1001010101100010100 |
3 | 101010200120111111100212 |
4 | 1202300001022230110 |
5 | 3214123232423220 |
6 | 120413252224552 |
7 | 10442402526134 |
oct | 1426001125424 |
9 | 333616444325 |
10 | 106032311060 |
11 | 40a71525745 |
12 | 1867200b158 |
13 | 9cca4ac380 |
14 | 51bc280ac4 |
15 | 2b58b060c5 |
hex | 18b004ab14 |
106032311060 has 48 divisors (see below), whose sum is σ = 239828566656. Its totient is φ = 39145099392.
The previous prime is 106032311053. The next prime is 106032311083. The reversal of 106032311060 is 60113230601.
It is a happy number.
It is a super-2 number, since 2×1060323110602 (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 (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2265617 + ... + 2311943.
It is an arithmetic number, because the mean of its divisors is an integer number (4996428472).
Almost surely, 2106032311060 is an apocalyptic number.
106032311060 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106032311060 is an abundant number, since it is smaller than the sum of its proper divisors (133796255596).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106032311060 is a wasteful number, since it uses less digits than its factorization.
106032311060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55152 (or 55150 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 106032311060 its reverse (60113230601), we get a palindrome (166145541661).
The spelling of 106032311060 in words is "one hundred six billion, thirty-two million, three hundred eleven thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •