Base | Representation |
---|---|
bin | 11000001111010001010110… |
… | …000111101001111111101000 |
3 | 111222110002202211020200200111 |
4 | 120033101112013221333220 |
5 | 102433033441440244222 |
6 | 1014420305545544104 |
7 | 31311531101611615 |
oct | 3017212607517750 |
9 | 458402684220614 |
10 | 106602533134312 |
11 | 30a6a975917456 |
12 | bb583507a5034 |
13 | 4763763b94187 |
14 | 1c4783947d50c |
15 | c4ce9ab98777 |
hex | 60f4561e9fe8 |
106602533134312 has 128 divisors (see below), whose sum is σ = 216855137520000. Its totient is φ = 48971850310656.
The previous prime is 106602533134249. The next prime is 106602533134313. The reversal of 106602533134312 is 213431335206601.
106602533134312 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1066025331343122 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (106602533134313) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 256222678 + ... + 256638394.
It is an arithmetic number, because the mean of its divisors is an integer number (1694180761875).
Almost surely, 2106602533134312 is an apocalyptic number.
It is an amenable number.
106602533134312 is an abundant number, since it is smaller than the sum of its proper divisors (110252604385688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106602533134312 is a wasteful number, since it uses less digits than its factorization.
106602533134312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 416163 (or 416159 counting only the distinct ones).
The product of its (nonzero) digits is 233280, while the sum is 40.
The spelling of 106602533134312 in words is "one hundred six trillion, six hundred two billion, five hundred thirty-three million, one hundred thirty-four thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •