Base | Representation |
---|---|
bin | 111101011001100… |
… | …111101101101001 |
3 | 2122210100211211011 |
4 | 331121213231221 |
5 | 4102203021231 |
6 | 250115103521 |
7 | 34345634041 |
oct | 7531475551 |
9 | 2583324734 |
10 | 1030126441 |
11 | 489530273 |
12 | 248ba1ba1 |
13 | 135557896 |
14 | 9ab50721 |
15 | 606829b1 |
hex | 3d667b69 |
1030126441 has 8 divisors (see below), whose sum is σ = 1091016864. Its totient is φ = 969268800.
The previous prime is 1030126417. The next prime is 1030126451. The reversal of 1030126441 is 1446210301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1030126441 - 211 = 1030124393 is a prime.
It is a super-2 number, since 2×10301264412 = 2122320968894652962, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1030126451) 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 7 ways as a sum of consecutive naturals, for example, 90706 + ... + 101428.
It is an arithmetic number, because the mean of its divisors is an integer number (136377108).
Almost surely, 21030126441 is an apocalyptic number.
It is an amenable number.
1030126441 is a deficient number, since it is larger than the sum of its proper divisors (60890423).
1030126441 is a wasteful number, since it uses less digits than its factorization.
1030126441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16391.
The product of its (nonzero) digits is 576, while the sum is 22.
The square root of 1030126441 is about 32095.5828892388. The cubic root of 1030126441 is about 1009.9429569457.
Adding to 1030126441 its reverse (1446210301), we get a palindrome (2476336742).
The spelling of 1030126441 in words is "one billion, thirty million, one hundred twenty-six thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •