Base | Representation |
---|---|
bin | 10001000001100011011… |
… | …110101111001001110000 |
3 | 11010211201100110002021121 |
4 | 101001203132233021300 |
5 | 123131423411400402 |
6 | 2253240015232024 |
7 | 150344133554035 |
oct | 21014336571160 |
9 | 4124640402247 |
10 | 1169900106352 |
11 | 41117412452a |
12 | 16a899218614 |
13 | 86423618653 |
14 | 408a2b1938c |
15 | 2067242d837 |
hex | 110637af270 |
1169900106352 has 40 divisors (see below), whose sum is σ = 2387719118160. Its totient is φ = 553759395840.
The previous prime is 1169900106343. The next prime is 1169900106359. The reversal of 1169900106352 is 2536010099611.
It is a junction number, because it is equal to n+sod(n) for n = 1169900106299 and 1169900106308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1169900106359) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 984049 + ... + 1818832.
It is an arithmetic number, because the mean of its divisors is an integer number (59692977954).
Almost surely, 21169900106352 is an apocalyptic number.
It is an amenable number.
1169900106352 is an abundant number, since it is smaller than the sum of its proper divisors (1217819011808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1169900106352 is a wasteful number, since it uses less digits than its factorization.
1169900106352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2804281 (or 2804275 counting only the distinct ones).
The product of its (nonzero) digits is 87480, while the sum is 43.
The spelling of 1169900106352 in words is "one trillion, one hundred sixty-nine billion, nine hundred million, one hundred six thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •