Base | Representation |
---|---|
bin | 10100100101110101010… |
… | …000100011001011010001 |
3 | 12000021101120210200002100 |
4 | 110211311100203023101 |
5 | 141140420421404131 |
6 | 3002014115311013 |
7 | 204142206260130 |
oct | 24456520431321 |
9 | 5007346720070 |
10 | 1415011513041 |
11 | 4a6115123215 |
12 | 1aa2a45ab469 |
13 | a3586954379 |
14 | 4c6b6189917 |
15 | 26c1ae9a7e6 |
hex | 149754232d1 |
1415011513041 has 24 divisors (see below), whose sum is σ = 2339002475264. Its totient is φ = 807501312000.
The previous prime is 1415011513033. The next prime is 1415011513057. The reversal of 1415011513041 is 1403151105141.
It is a happy number.
1415011513041 is a `hidden beast` number, since 1 + 4 + 1 + 501 + 151 + 3 + 0 + 4 + 1 = 666.
It is not a de Polignac number, because 1415011513041 - 23 = 1415011513033 is a prime.
It is a super-2 number, since 2×14150115130412 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1415011512996 and 1415011513014.
It is not an unprimeable number, because it can be changed into a prime (1415011513541) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 14906416 + ... + 15001041.
Almost surely, 21415011513041 is an apocalyptic number.
It is an amenable number.
1415011513041 is a deficient number, since it is larger than the sum of its proper divisors (923990962223).
1415011513041 is a wasteful number, since it uses less digits than its factorization.
1415011513041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29908221 (or 29908218 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 27.
Adding to 1415011513041 its reverse (1403151105141), we get a palindrome (2818162618182).
The spelling of 1415011513041 in words is "one trillion, four hundred fifteen billion, eleven million, five hundred thirteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •