Base | Representation |
---|---|
bin | 1010100100111110100011… |
… | …1000100111000100001001 |
3 | 1112011212001102122202222222 |
4 | 2221033220320213010021 |
5 | 3011023011201440312 |
6 | 40422531404223425 |
7 | 2310160514450003 |
oct | 251175070470411 |
9 | 45155042582888 |
10 | 11630383624457 |
11 | 3784466397244 |
12 | 137a067b3ab75 |
13 | 664981a73470 |
14 | 2c2cb0ba5373 |
15 | 1527edb7c672 |
hex | a93e8e27109 |
11630383624457 has 16 divisors (see below), whose sum is σ = 12701340614928. Its totient is φ = 10585598607360.
The previous prime is 11630383624427. The next prime is 11630383624501. The reversal of 11630383624457 is 75442638303611.
It can be written as a sum of positive squares in 8 ways, for example, as 1252991435641 + 10377392188816 = 1119371^2 + 3221396^2 .
It is a cyclic number.
It is not a de Polignac number, because 11630383624457 - 210 = 11630383623433 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11630383624399 and 11630383624408.
It is not an unprimeable number, because it can be changed into a prime (11630383624427) 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, 20227394 + ... + 20794427.
It is an arithmetic number, because the mean of its divisors is an integer number (793833788433).
Almost surely, 211630383624457 is an apocalyptic number.
It is an amenable number.
11630383624457 is a deficient number, since it is larger than the sum of its proper divisors (1070956990471).
11630383624457 is a wasteful number, since it uses less digits than its factorization.
11630383624457 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41022140.
The product of its (nonzero) digits is 8709120, while the sum is 53.
The spelling of 11630383624457 in words is "eleven trillion, six hundred thirty billion, three hundred eighty-three million, six hundred twenty-four thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •