Base | Representation |
---|---|
bin | 111100011100001… |
… | …110111011010010 |
3 | 2121200002021022122 |
4 | 330130032323102 |
5 | 4034043043010 |
6 | 244342134242 |
7 | 34062101504 |
oct | 7434167322 |
9 | 2550067278 |
10 | 1014034130 |
11 | 48043993a |
12 | 243721382 |
13 | 132111cc5 |
14 | 98961d74 |
15 | 5e054855 |
hex | 3c70eed2 |
1014034130 has 8 divisors (see below), whose sum is σ = 1825261452. Its totient is φ = 405613648.
The previous prime is 1014034117. The next prime is 1014034183. The reversal of 1014034130 is 314304101.
It can be written as a sum of positive squares in 2 ways, for example, as 896463481 + 117570649 = 29941^2 + 10843^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×10140341303 (a number of 28 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1014034099 and 1014034108.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 50701697 + ... + 50701716.
Almost surely, 21014034130 is an apocalyptic number.
1014034130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1014034130 is a deficient number, since it is larger than the sum of its proper divisors (811227322).
1014034130 is a wasteful number, since it uses less digits than its factorization.
1014034130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101403420.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 1014034130 is about 31843.9025560624. The cubic root of 1014034130 is about 1004.6563282883.
Adding to 1014034130 its reverse (314304101), we get a palindrome (1328338231).
The spelling of 1014034130 in words is "one billion, fourteen million, thirty-four thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •