Base | Representation |
---|---|
bin | 1100000101100101000… |
… | …01101110001111101001 |
3 | 1110200222210212211222211 |
4 | 12002302201232033221 |
5 | 23301024340420113 |
6 | 514443002245121 |
7 | 42001551064504 |
oct | 6026241561751 |
9 | 1420883784884 |
10 | 415312045033 |
11 | 150150905476 |
12 | 685a71b67a1 |
13 | 30218a11812 |
14 | 1615ba1413b |
15 | ac0aceab3d |
hex | 60b286e3e9 |
415312045033 has 16 divisors (see below), whose sum is σ = 437000389632. Its totient is φ = 394200576000.
The previous prime is 415312045019. The next prime is 415312045063. The reversal of 415312045033 is 330540213514.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-415312045033 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 415312044986 and 415312045004.
It is not an unprimeable number, because it can be changed into a prime (415312045063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 64048 + ... + 913633.
It is an arithmetic number, because the mean of its divisors is an integer number (27312524352).
Almost surely, 2415312045033 is an apocalyptic number.
It is an amenable number.
415312045033 is a deficient number, since it is larger than the sum of its proper divisors (21688344599).
415312045033 is a wasteful number, since it uses less digits than its factorization.
415312045033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 977976.
The product of its (nonzero) digits is 21600, while the sum is 31.
Adding to 415312045033 its reverse (330540213514), we get a palindrome (745852258547).
The spelling of 415312045033 in words is "four hundred fifteen billion, three hundred twelve million, forty-five thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •