Base | Representation |
---|---|
bin | 110001100001110010… |
… | …1001010000000000000 |
3 | 101011112110001212010012 |
4 | 1203003211022000000 |
5 | 3220311242400022 |
6 | 120510014524052 |
7 | 10453466303522 |
oct | 1430345120000 |
9 | 334473055105 |
10 | 106360512512 |
11 | 4111a811311 |
12 | 18743b06628 |
13 | a0504a2607 |
14 | 520dab5a12 |
15 | 2b77835de2 |
hex | 18c394a000 |
106360512512 has 112 divisors (see below), whose sum is σ = 228601828800. Its totient is φ = 49300635648.
The previous prime is 106360512473. The next prime is 106360512523. The reversal of 106360512512 is 215215063601.
It is a super-2 number, since 2×1063605125122 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9324989 + ... + 9336387.
Almost surely, 2106360512512 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 106360512512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (114300914400).
106360512512 is an abundant number, since it is smaller than the sum of its proper divisors (122241316288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106360512512 is an equidigital number, since it uses as much as digits as its factorization.
106360512512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11509 (or 11485 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 32.
The spelling of 106360512512 in words is "one hundred six billion, three hundred sixty million, five hundred twelve thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •