Base | Representation |
---|---|
bin | 10011010100010001111… |
… | …00011011101011001000 |
3 | 2100110011221222210210022 |
4 | 21222020330123223020 |
5 | 41333300430210302 |
6 | 1224524312440012 |
7 | 65644443136451 |
oct | 11521074335310 |
9 | 2313157883708 |
10 | 663722506952 |
11 | 23653506318a |
12 | a87733a9008 |
13 | 4a78668b81b |
14 | 241a5296128 |
15 | 123e92d08a2 |
hex | 9a88f1bac8 |
663722506952 has 36 divisors (see below), whose sum is σ = 1256083030995. Its totient is φ = 328795387648.
The previous prime is 663722506943. The next prime is 663722506991. The reversal of 663722506952 is 259605227366.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 5 ways, for example, as 236929456516 + 426793050436 = 486754^2 + 653294^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=576074.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 663722506894 and 663722506903.
It is an unprimeable number.
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 8 ways as a sum of consecutive naturals, for example, 260384174 + ... + 260386722.
Almost surely, 2663722506952 is an apocalyptic number.
It is an amenable number.
663722506952 is a deficient number, since it is larger than the sum of its proper divisors (592360524043).
663722506952 is an frugal number, since it uses more digits than its factorization.
663722506952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5330 (or 2664 counting only the distinct ones).
The product of its (nonzero) digits is 8164800, while the sum is 53.
The spelling of 663722506952 in words is "six hundred sixty-three billion, seven hundred twenty-two million, five hundred six thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •