Base | Representation |
---|---|
bin | 1001011110001100101011… |
… | …0000011010001000110111 |
3 | 1100212121101121111000102000 |
4 | 2113203022300122020313 |
5 | 2331112144004204421 |
6 | 34052151014550343 |
7 | 2123262412626024 |
oct | 227431260321067 |
9 | 40777347430360 |
10 | 10414402413111 |
11 | 33557a5728574 |
12 | 120246a3683b3 |
13 | 5a70c65804a8 |
14 | 2800b9dda54b |
15 | 130d80e5d226 |
hex | 978cac1a237 |
10414402413111 has 16 divisors (see below), whose sum is σ = 15443177234400. Its totient is φ = 6936440128704.
The previous prime is 10414402413059. The next prime is 10414402413119. The reversal of 10414402413111 is 11131420441401.
10414402413111 is a `hidden beast` number, since 1 + 0 + 414 + 4 + 0 + 241 + 3 + 1 + 1 + 1 = 666.
It is not a de Polignac number, because 10414402413111 - 27 = 10414402412983 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10414402413119) 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, 180382086 + ... + 180439811.
It is an arithmetic number, because the mean of its divisors is an integer number (965198577150).
Almost surely, 210414402413111 is an apocalyptic number.
10414402413111 is a deficient number, since it is larger than the sum of its proper divisors (5028774821289).
10414402413111 is a wasteful number, since it uses less digits than its factorization.
10414402413111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 360822975 (or 360822969 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 27.
Adding to 10414402413111 its reverse (11131420441401), we get a palindrome (21545822854512).
The spelling of 10414402413111 in words is "ten trillion, four hundred fourteen billion, four hundred two million, four hundred thirteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.026 sec. • engine limits •