Base | Representation |
---|---|
bin | 111110111101010… |
… | …000101101100110 |
3 | 2201121111212222120 |
4 | 332331100231212 |
5 | 4130344343010 |
6 | 252451010410 |
7 | 35113643145 |
oct | 7675205546 |
9 | 2647455876 |
10 | 1056246630 |
11 | 4a22507aa |
12 | 255899a06 |
13 | 13aaa190a |
14 | a03cd75c |
15 | 62ae1e70 |
hex | 3ef50b66 |
1056246630 has 16 divisors (see below), whose sum is σ = 2534991984. Its totient is φ = 281665760.
The previous prime is 1056246577. The next prime is 1056246673. The reversal of 1056246630 is 366426501.
It is a super-2 number, since 2×10562466302 = 2231313886772713800, which contains 22 as substring.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 1056246591 and 1056246600.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17604081 + ... + 17604140.
It is an arithmetic number, because the mean of its divisors is an integer number (158436999).
Almost surely, 21056246630 is an apocalyptic number.
1056246630 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1056246630 is an abundant number, since it is smaller than the sum of its proper divisors (1478745354).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1056246630 is a wasteful number, since it uses less digits than its factorization.
1056246630 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35208231.
The product of its (nonzero) digits is 25920, while the sum is 33.
The square root of 1056246630 is about 32499.9481538048. The cubic root of 1056246630 is about 1018.4079450339.
The spelling of 1056246630 in words is "one billion, fifty-six million, two hundred forty-six thousand, six hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •