Base | Representation |
---|---|
bin | 111100011100100… |
… | …100001111000101 |
3 | 2121200020201001100 |
4 | 330130210033011 |
5 | 4034103341123 |
6 | 244344050313 |
7 | 34062614124 |
oct | 7434441705 |
9 | 2550221040 |
10 | 1014121413 |
11 | 480499478 |
12 | 243763999 |
13 | 132142956 |
14 | 98985abb |
15 | 5e070643 |
hex | 3c7243c5 |
1014121413 has 12 divisors (see below), whose sum is σ = 1470058668. Its totient is φ = 673673280.
The previous prime is 1014121399. The next prime is 1014121421. The reversal of 1014121413 is 3141214101.
1014121413 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 357890724 + 656230689 = 18918^2 + 25617^2 .
It is not a de Polignac number, because 1014121413 - 210 = 1014120389 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1014121463) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 197970 + ... + 203027.
It is an arithmetic number, because the mean of its divisors is an integer number (122504889).
Almost surely, 21014121413 is an apocalyptic number.
It is an amenable number.
1014121413 is a deficient number, since it is larger than the sum of its proper divisors (455937255).
1014121413 is a wasteful number, since it uses less digits than its factorization.
1014121413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 401284 (or 401281 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
The square root of 1014121413 is about 31845.2730087214. The cubic root of 1014121413 is about 1004.6851527298.
Adding to 1014121413 its reverse (3141214101), we get a palindrome (4155335514).
The spelling of 1014121413 in words is "one billion, fourteen million, one hundred twenty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •