Base | Representation |
---|---|
bin | 101111001100100000011010… |
… | …0110100011011001000101101 |
3 | 2000102212112122000011110001120 |
4 | 1132121000310310123020231 |
5 | 413403033440222320140 |
6 | 4030530255424531153 |
7 | 153304350241522452 |
oct | 13631006464331055 |
9 | 2012775560143046 |
10 | 415135245120045 |
11 | 11030296135365a |
12 | 3a687ba9780ab9 |
13 | 14a841161c5088 |
14 | 7472920055829 |
15 | 32ed948d2b1d0 |
hex | 1799034d1b22d |
415135245120045 has 64 divisors (see below), whose sum is σ = 683195702688000. Its totient is φ = 215165764509696.
The previous prime is 415135245120023. The next prime is 415135245120059. The reversal of 415135245120045 is 540021542531514.
It is not a de Polignac number, because 415135245120045 - 212 = 415135245115949 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 415135245119979 and 415135245120006.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 409780977 + ... + 410792793.
It is an arithmetic number, because the mean of its divisors is an integer number (10674932854500).
Almost surely, 2415135245120045 is an apocalyptic number.
It is an amenable number.
415135245120045 is a deficient number, since it is larger than the sum of its proper divisors (268060457567955).
415135245120045 is a wasteful number, since it uses less digits than its factorization.
415135245120045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1017182.
The product of its (nonzero) digits is 480000, while the sum is 42.
Adding to 415135245120045 its reverse (540021542531514), we get a palindrome (955156787651559).
The spelling of 415135245120045 in words is "four hundred fifteen trillion, one hundred thirty-five billion, two hundred forty-five million, one hundred twenty thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •