Base | Representation |
---|---|
bin | 111100010110110… |
… | …010110000010010 |
3 | 2121120101211001200 |
4 | 330112302300102 |
5 | 4033211424033 |
6 | 244251412030 |
7 | 34044011652 |
oct | 7426626022 |
9 | 2546354050 |
10 | 1012608018 |
11 | 47a655434 |
12 | 243154016 |
13 | 131a32b56 |
14 | 986b0362 |
15 | 5dd72013 |
hex | 3c5b2c12 |
1012608018 has 12 divisors (see below), whose sum is σ = 2193984078. Its totient is φ = 337536000.
The previous prime is 1012607987. The next prime is 1012608049. The reversal of 1012608018 is 8108062101.
It is an interprime number because it is at equal distance from previous prime (1012607987) and next prime (1012608049).
It can be written as a sum of positive squares in only one way, i.e., 616876569 + 395731449 = 24837^2 + 19893^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1012607982 and 1012608000.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 28127983 + ... + 28128018.
Almost surely, 21012608018 is an apocalyptic number.
1012608018 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
1012608018 is an abundant number, since it is smaller than the sum of its proper divisors (1181376060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1012608018 is a wasteful number, since it uses less digits than its factorization.
1012608018 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 56256009 (or 56256006 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 27.
The square root of 1012608018 is about 31821.5024472447. The cubic root of 1012608018 is about 1004.1851328946.
It can be divided in two parts, 101260 and 8018, that added together give a triangular number (109278 = T467).
The spelling of 1012608018 in words is "one billion, twelve million, six hundred eight thousand, eighteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •