Base | Representation |
---|---|
bin | 101111000100100111000011… |
… | …1111010010010101100000001 |
3 | 2000022000210110021102022211202 |
4 | 1132021032013322102230001 |
5 | 413232243411141110340 |
6 | 4024335541054150545 |
7 | 153133061203124000 |
oct | 13611160772225401 |
9 | 2008023407368752 |
10 | 414050012441345 |
11 | 10aa24695841735 |
12 | 3a5317bb4b2455 |
13 | 14a059969a9557 |
14 | 74361add24c37 |
15 | 32d05cea2cc15 |
hex | 1789387e92b01 |
414050012441345 has 64 divisors (see below), whose sum is σ = 614356551244800. Its totient is φ = 266851254168576.
The previous prime is 414050012441171. The next prime is 414050012441381. The reversal of 414050012441345 is 543144210050414.
It is not a de Polignac number, because 414050012441345 - 28 = 414050012441089 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 414050012441299 and 414050012441308.
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, 11428367 + ... + 30963003.
It is an arithmetic number, because the mean of its divisors is an integer number (9599321113200).
Almost surely, 2414050012441345 is an apocalyptic number.
It is an amenable number.
414050012441345 is a deficient number, since it is larger than the sum of its proper divisors (200306538803455).
414050012441345 is a wasteful number, since it uses less digits than its factorization.
414050012441345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19535407 (or 19535393 counting only the distinct ones).
The product of its (nonzero) digits is 153600, while the sum is 38.
Adding to 414050012441345 its reverse (543144210050414), we get a palindrome (957194222491759).
The spelling of 414050012441345 in words is "four hundred fourteen trillion, fifty billion, twelve million, four hundred forty-one thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •