Base | Representation |
---|---|
bin | 1001011110001011100100… |
… | …0011110111101111111010 |
3 | 1100212120121220211112211000 |
4 | 2113202321003313233322 |
5 | 2331111042003301432 |
6 | 34052101331345430 |
7 | 2123252146260516 |
oct | 227427103675772 |
9 | 40776556745730 |
10 | 10414105525242 |
11 | 335566308a2a1 |
12 | 12023a6a52276 |
13 | 5a7079c020b3 |
14 | 28008c7d7146 |
15 | 130d64d6657c |
hex | 978b90f7bfa |
10414105525242 has 64 divisors (see below), whose sum is σ = 24361173648000. Its totient is φ = 3288571363584.
The previous prime is 10414105525183. The next prime is 10414105525249. The reversal of 10414105525242 is 24252550141401.
10414105525242 is a `hidden beast` number, since 1 + 0 + 4 + 1 + 4 + 10 + 552 + 52 + 42 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 10414105525197 and 10414105525206.
It is not an unprimeable number, because it can be changed into a prime (10414105525249) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 41914434 + ... + 42162162.
It is an arithmetic number, because the mean of its divisors is an integer number (380643338250).
Almost surely, 210414105525242 is an apocalyptic number.
10414105525242 is an abundant number, since it is smaller than the sum of its proper divisors (13947068122758).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10414105525242 is a wasteful number, since it uses less digits than its factorization.
10414105525242 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 288732 (or 288726 counting only the distinct ones).
The product of its (nonzero) digits is 64000, while the sum is 36.
Adding to 10414105525242 its reverse (24252550141401), we get a palindrome (34666655666643).
The spelling of 10414105525242 in words is "ten trillion, four hundred fourteen billion, one hundred five million, five hundred twenty-five thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •