Base | Representation |
---|---|
bin | 1001110101101100101… |
… | …1001101110111000100 |
3 | 121011022020010222121120 |
4 | 2131123023031313010 |
5 | 10232140022012211 |
6 | 205353004113540 |
7 | 15132543056511 |
oct | 2353313156704 |
9 | 534266128546 |
10 | 169033391556 |
11 | 65760a40a17 |
12 | 28914b358b0 |
13 | 12c2a90b823 |
14 | 827753c308 |
15 | 45e4a62d06 |
hex | 275b2cddc4 |
169033391556 has 12 divisors (see below), whose sum is σ = 394411246992. Its totient is φ = 56344463848.
The previous prime is 169033391507. The next prime is 169033391587. The reversal of 169033391556 is 655193330961.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×1690333915562 (a number of 23 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 169033391499 and 169033391508.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7043057970 + ... + 7043057993.
It is an arithmetic number, because the mean of its divisors is an integer number (32867603916).
Almost surely, 2169033391556 is an apocalyptic number.
It is an amenable number.
169033391556 is an abundant number, since it is smaller than the sum of its proper divisors (225377855436).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
169033391556 is a wasteful number, since it uses less digits than its factorization.
169033391556 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14086115970 (or 14086115968 counting only the distinct ones).
The product of its (nonzero) digits is 1968300, while the sum is 51.
The spelling of 169033391556 in words is "one hundred sixty-nine billion, thirty-three million, three hundred ninety-one thousand, five hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •