Base | Representation |
---|---|
bin | 10000000110111000110… |
… | …000111100010010001100 |
3 | 10220211010012201220020200 |
4 | 100012320300330102030 |
5 | 121113421021321102 |
6 | 2204301130213500 |
7 | 142654113302466 |
oct | 20067060742214 |
9 | 3824105656220 |
10 | 1106906432652 |
11 | 397488908079 |
12 | 15a638884290 |
13 | 804c48b0607 |
14 | 3b808829136 |
15 | 1dbd6e8651c |
hex | 101b8c3c48c |
1106906432652 has 36 divisors (see below), whose sum is σ = 2809720673760. Its totient is φ = 367425005472.
The previous prime is 1106906432647. The next prime is 1106906432659. The reversal of 1106906432652 is 2562346096011.
It is a tau number, because it is divible by the number of its divisors (36).
It is a super-2 number, since 2×11069064326522 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1106906432598 and 1106906432607.
It is not an unprimeable number, because it can be changed into a prime (1106906432659) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 64316503 + ... + 64333710.
Almost surely, 21106906432652 is an apocalyptic number.
1106906432652 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1106906432652 is an abundant number, since it is smaller than the sum of its proper divisors (1702814241108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1106906432652 is a wasteful number, since it uses less digits than its factorization.
1106906432652 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 128650462 (or 128650457 counting only the distinct ones).
The product of its (nonzero) digits is 466560, while the sum is 45.
The spelling of 1106906432652 in words is "one trillion, one hundred six billion, nine hundred six million, four hundred thirty-two thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •