Base | Representation |
---|---|
bin | 110001100011010101… |
… | …1100100001100100000 |
3 | 101011200001221022220110 |
4 | 1203012223210030200 |
5 | 3220413101234240 |
6 | 120515113411320 |
7 | 10455000350454 |
oct | 1430653441440 |
9 | 334601838813 |
10 | 106412524320 |
11 | 41147106583 |
12 | 18759409b40 |
13 | a05b1b362b |
14 | 5216974664 |
15 | 2b7c1abc80 |
hex | 18c6ae4320 |
106412524320 has 96 divisors (see below), whose sum is σ = 335346298560. Its totient is φ = 28364241920.
The previous prime is 106412524259. The next prime is 106412524423. The reversal of 106412524320 is 23425214601.
It is a tau number, because it is divible by the number of its divisors (96).
It is a super-2 number, since 2×1064125243202 (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 an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1075330 + ... + 1170110.
It is an arithmetic number, because the mean of its divisors is an integer number (3493190610).
Almost surely, 2106412524320 is an apocalyptic number.
106412524320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106412524320 is an abundant number, since it is smaller than the sum of its proper divisors (228933774240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106412524320 is a wasteful number, since it uses less digits than its factorization.
106412524320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97138 (or 97130 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 30.
Adding to 106412524320 its reverse (23425214601), we get a palindrome (129837738921).
The spelling of 106412524320 in words is "one hundred six billion, four hundred twelve million, five hundred twenty-four thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •