Base | Representation |
---|---|
bin | 110001101100111001… |
… | …0000111010110010000 |
3 | 101012111101222121020110 |
4 | 1203121302013112100 |
5 | 3222042122231042 |
6 | 121011002441320 |
7 | 10465641413142 |
oct | 1433162072620 |
9 | 335441877213 |
10 | 106733008272 |
11 | 412a1000950 |
12 | 18828803240 |
13 | a0ac703bc7 |
14 | 524735ac92 |
15 | 2b9a3b509c |
hex | 18d9c87590 |
106733008272 has 40 divisors (see below), whose sum is σ = 300793024800. Its totient is φ = 32343335680.
The previous prime is 106733008259. The next prime is 106733008309. The reversal of 106733008272 is 272800337601.
It is a super-2 number, since 2×1067330082722 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106733008272.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 101072397 + ... + 101073452.
It is an arithmetic number, because the mean of its divisors is an integer number (7519825620).
Almost surely, 2106733008272 is an apocalyptic number.
106733008272 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
106733008272 is an abundant number, since it is smaller than the sum of its proper divisors (194060016528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106733008272 is a wasteful number, since it uses less digits than its factorization.
106733008272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 202145871 (or 202145865 counting only the distinct ones).
The product of its (nonzero) digits is 84672, while the sum is 39.
The spelling of 106733008272 in words is "one hundred six billion, seven hundred thirty-three million, eight thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •