Base | Representation |
---|---|
bin | 1001011110001011101010… |
… | …0010011111101101001001 |
3 | 1100212120200122111210011002 |
4 | 2113202322202133231021 |
5 | 2331111114331033231 |
6 | 34052104015144345 |
7 | 2123252600152055 |
oct | 227427242375511 |
9 | 40776618453132 |
10 | 10414130330441 |
11 | 3355676091862 |
12 | 12023b32150b5 |
13 | 5a70820a8726 |
14 | 280091c12c65 |
15 | 130d671160cb |
hex | 978ba89fb49 |
10414130330441 has 16 divisors (see below), whose sum is σ = 10793021712000. Its totient is φ = 10036565884800.
The previous prime is 10414130330423. The next prime is 10414130330489. The reversal of 10414130330441 is 14403303141401.
It is a cyclic number.
It is not a de Polignac number, because 10414130330441 - 222 = 10414126136137 is a prime.
It is a super-2 number, since 2×104141303304412 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10414130330341) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 74938181 + ... + 75077021.
It is an arithmetic number, because the mean of its divisors is an integer number (674563857000).
Almost surely, 210414130330441 is an apocalyptic number.
It is an amenable number.
10414130330441 is a deficient number, since it is larger than the sum of its proper divisors (378891381559).
10414130330441 is a wasteful number, since it uses less digits than its factorization.
10414130330441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 143600.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 10414130330441 its reverse (14403303141401), we get a palindrome (24817433471842).
The spelling of 10414130330441 in words is "ten trillion, four hundred fourteen billion, one hundred thirty million, three hundred thirty thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •