Base | Representation |
---|---|
bin | 100001101011010… |
… | …0111010000000110 |
3 | 2220202022000112020 |
4 | 1003112213100012 |
5 | 4303240021124 |
6 | 304043504010 |
7 | 40000565523 |
oct | 10326472006 |
9 | 2822260466 |
10 | 1130001414 |
11 | 52a946873 |
12 | 276528006 |
13 | 1501564b9 |
14 | aa10c14a |
15 | 69310379 |
hex | 435a7406 |
1130001414 has 16 divisors (see below), whose sum is σ = 2337934320. Its totient is φ = 363678560.
The previous prime is 1130001409. The next prime is 1130001419. The reversal of 1130001414 is 4141000311.
It is an interprime number because it is at equal distance from previous prime (1130001409) and next prime (1130001419).
It is a junction number, because it is equal to n+sod(n) for n = 1130001393 and 1130001402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1130001419) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3246957 + ... + 3247304.
It is an arithmetic number, because the mean of its divisors is an integer number (146120895).
Almost surely, 21130001414 is an apocalyptic number.
1130001414 is an abundant number, since it is smaller than the sum of its proper divisors (1207932906).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1130001414 is a wasteful number, since it uses less digits than its factorization.
1130001414 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6494295.
The product of its (nonzero) digits is 48, while the sum is 15.
The square root of 1130001414 is about 33615.4936599182. The cubic root of 1130001414 is about 1041.5808717591.
Adding to 1130001414 its reverse (4141000311), we get a palindrome (5271001725).
The spelling of 1130001414 in words is "one billion, one hundred thirty million, one thousand, four hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •