Base | Representation |
---|---|
bin | 111100010110111… |
… | …111100110010110 |
3 | 2121120111111020021 |
4 | 330112333212112 |
5 | 4033220120010 |
6 | 244252455354 |
7 | 34044321232 |
oct | 7426774626 |
9 | 2546444207 |
10 | 1012660630 |
11 | 47a690a13 |
12 | 24317a55a |
13 | 131a50a97 |
14 | 986c55c2 |
15 | 5dd828da |
hex | 3c5bf996 |
1012660630 has 8 divisors (see below), whose sum is σ = 1822789152. Its totient is φ = 405064248.
The previous prime is 1012660619. The next prime is 1012660633. The reversal of 1012660630 is 360662101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 1012660595 and 1012660604.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012660633) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 50633022 + ... + 50633041.
It is an arithmetic number, because the mean of its divisors is an integer number (227848644).
Almost surely, 21012660630 is an apocalyptic number.
1012660630 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1012660630 is a deficient number, since it is larger than the sum of its proper divisors (810128522).
1012660630 is a wasteful number, since it uses less digits than its factorization.
1012660630 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101266070.
The product of its (nonzero) digits is 1296, while the sum is 25.
The square root of 1012660630 is about 31822.3291102333. The cubic root of 1012660630 is about 1004.2025240510.
It can be divided in two parts, 10126 and 60630, that added together give a square (70756 = 2662).
The spelling of 1012660630 in words is "one billion, twelve million, six hundred sixty thousand, six hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •