Base | Representation |
---|---|
bin | 100001001100101… |
… | …000100100001110 |
3 | 1102211000111111200 |
4 | 201030220210032 |
5 | 2120040210024 |
6 | 131133330330 |
7 | 16542040062 |
oct | 4114504416 |
9 | 1384014450 |
10 | 556960014 |
11 | 266431336 |
12 | 1366369a6 |
13 | 8b509450 |
14 | 53d81aa2 |
15 | 33d6a2c9 |
hex | 2132890e |
556960014 has 48 divisors (see below), whose sum is σ = 1303974672. Its totient is φ = 170792064.
The previous prime is 556960007. The next prime is 556960039. The reversal of 556960014 is 410069655.
556960014 is a `hidden beast` number, since 556 + 96 + 0 + 0 + 14 = 666.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 67962 + ... + 75714.
It is an arithmetic number, because the mean of its divisors is an integer number (27166139).
Almost surely, 2556960014 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 556960014, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (651987336).
556960014 is an abundant number, since it is smaller than the sum of its proper divisors (747014658).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
556960014 is a wasteful number, since it uses less digits than its factorization.
556960014 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8081 (or 8078 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 36.
The square root of 556960014 is about 23600.0002966102. Note that the first 3 decimals coincide. The cubic root of 556960014 is about 822.7628469832.
The spelling of 556960014 in words is "five hundred fifty-six million, nine hundred sixty thousand, fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •