Base | Representation |
---|---|
bin | 101111101011000011101… |
… | …1000110100001110111110 |
3 | 212012101002212121111212120 |
4 | 1133112013120310032332 |
5 | 1324322143204242331 |
6 | 21533554104143410 |
7 | 1244242026544413 |
oct | 137260730641676 |
9 | 25171085544776 |
10 | 6552096555966 |
11 | 20a6801769485 |
12 | 899a0ba67b66 |
13 | 386b24700940 |
14 | 1891a1d7410a |
15 | b567d547796 |
hex | 5f5876343be |
6552096555966 has 128 divisors (see below), whose sum is σ = 14524453192704. Its totient is φ = 1958197109760.
The previous prime is 6552096555919. The next prime is 6552096555967. The reversal of 6552096555966 is 6695556902556.
It is a self number, because there is not a number n which added to its sum of digits gives 6552096555966.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6552096555967) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 106122381 + ... + 106184103.
It is an arithmetic number, because the mean of its divisors is an integer number (113472290568).
Almost surely, 26552096555966 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 6552096555966, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7262226596352).
6552096555966 is an abundant number, since it is smaller than the sum of its proper divisors (7972356636738).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6552096555966 is a wasteful number, since it uses less digits than its factorization.
6552096555966 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62098.
The product of its (nonzero) digits is 656100000, while the sum is 69.
The spelling of 6552096555966 in words is "six trillion, five hundred fifty-two billion, ninety-six million, five hundred fifty-five thousand, nine hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •