Base | Representation |
---|---|
bin | 1100000101011100100… |
… | …10111000010101010111 |
3 | 1110200210212021200201101 |
4 | 12002232102320111113 |
5 | 23300403201422320 |
6 | 514431544410531 |
7 | 42000026435344 |
oct | 6025622702527 |
9 | 1420725250641 |
10 | 415241045335 |
11 | 150114821336 |
12 | 68587476a47 |
13 | 302070b2c6c |
14 | 161524117cb |
15 | ac04973c0a |
hex | 60ae4b8557 |
415241045335 has 8 divisors (see below), whose sum is σ = 511756531776. Its totient is φ = 323214651360.
The previous prime is 415241045327. The next prime is 415241045353. The reversal of 415241045335 is 533540142514.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 415241045335 - 23 = 415241045327 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 415241045294 and 415241045303.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 1122272911 + ... + 1122273280.
It is an arithmetic number, because the mean of its divisors is an integer number (63969566472).
Almost surely, 2415241045335 is an apocalyptic number.
415241045335 is a deficient number, since it is larger than the sum of its proper divisors (96515486441).
415241045335 is a wasteful number, since it uses less digits than its factorization.
415241045335 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2244546233.
The product of its (nonzero) digits is 144000, while the sum is 37.
Adding to 415241045335 its reverse (533540142514), we get a palindrome (948781187849).
The spelling of 415241045335 in words is "four hundred fifteen billion, two hundred forty-one million, forty-five thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •