Base | Representation |
---|---|
bin | 110001100011010011… |
… | …0111010111001111100 |
3 | 101011122222122110112110 |
4 | 1203012212322321330 |
5 | 3220412243302440 |
6 | 120515031334020 |
7 | 10454654116353 |
oct | 1430646727174 |
9 | 334588573473 |
10 | 106411306620 |
11 | 41146454713 |
12 | 18758b21310 |
13 | a05ab782b8 |
14 | 521673899a |
15 | 2b7c01b080 |
hex | 18c69bae7c |
106411306620 has 48 divisors (see below), whose sum is σ = 306004412448. Its totient is φ = 27609419520.
The previous prime is 106411306549. The next prime is 106411306663. The reversal of 106411306620 is 26603114601.
It is a super-2 number, since 2×1064113066202 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 23964291 + ... + 23968730.
It is an arithmetic number, because the mean of its divisors is an integer number (6375091926).
Almost surely, 2106411306620 is an apocalyptic number.
106411306620 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106411306620 is an abundant number, since it is smaller than the sum of its proper divisors (199593105828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106411306620 is a wasteful number, since it uses less digits than its factorization.
106411306620 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47933070 (or 47933068 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 30.
The spelling of 106411306620 in words is "one hundred six billion, four hundred eleven million, three hundred six thousand, six hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •