Base | Representation |
---|---|
bin | 11000010100000001011110… |
… | …000011100001111110010000 |
3 | 112000121022122200220112020100 |
4 | 120110001132003201332100 |
5 | 103003411230422110404 |
6 | 1015230313135412400 |
7 | 31344241243421400 |
oct | 3024013603417620 |
9 | 460538580815210 |
10 | 106929083785104 |
11 | 31086408185659 |
12 | bbab6a5984100 |
13 | 47884a5573c29 |
14 | 1c59576894800 |
15 | c5670e22bd39 |
hex | 61405e0e1f90 |
106929083785104 has 405 divisors, whose sum is σ = 350201434400337. Its totient is φ = 30368757694464.
The previous prime is 106929083785093. The next prime is 106929083785151. The reversal of 106929083785104 is 401587380929601.
The square root of 106929083785104 is 10340652.
It is a perfect power (a square), and thus also a powerful number.
106929083785104 is a `hidden beast` number, since 1 + 0 + 69 + 29 + 0 + 8 + 37 + 8 + 510 + 4 = 666.
It can be written as a sum of positive squares in only one way, i.e., 105271293632400 + 1657790152704 = 10260180^2 + 1287552^2 .
It is a super-2 number, since 2×1069290837851042 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 80 ways as a sum of consecutive naturals, for example, 223233995137 + ... + 223233995615.
It is a 1-persistent number, because it is pandigital, but 2⋅106929083785104 = 213858167570208 is not.
Almost surely, 2106929083785104 is an apocalyptic number.
106929083785104 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
106929083785104 is the 10340652-nd square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 106929083785104
106929083785104 is an abundant number, since it is smaller than the sum of its proper divisors (243272350615233).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106929083785104 is an frugal number, since it uses more digits than its factorization.
106929083785104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1500 (or 748 counting only the distinct ones).
The product of its (nonzero) digits is 26127360, while the sum is 63.
The spelling of 106929083785104 in words is "one hundred six trillion, nine hundred twenty-nine billion, eighty-three million, seven hundred eighty-five thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •