Base | Representation |
---|---|
bin | 101111000101111011011000… |
… | …1100110000111111110110001 |
3 | 2000022200002212121101222212111 |
4 | 1132023312301212013332301 |
5 | 413243230243202032423 |
6 | 4024555050202125321 |
7 | 153152131552436350 |
oct | 13613666146077661 |
9 | 2008602777358774 |
10 | 414231100424113 |
11 | 10aa94472230425 |
12 | 3a5609194b0841 |
13 | 14a19a95b5498b |
14 | 7440c6c411997 |
15 | 32d517c9e660d |
hex | 178bdb1987fb1 |
414231100424113 has 16 divisors (see below), whose sum is σ = 498338531435520. Its totient is φ = 336357714526416.
The previous prime is 414231100423993. The next prime is 414231100424123. The reversal of 414231100424113 is 311424001132414.
It is a cyclic number.
It is not a de Polignac number, because 414231100424113 - 213 = 414231100415921 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (414231100424123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 43814245 + ... + 52422802.
It is an arithmetic number, because the mean of its divisors is an integer number (31146158214720).
Almost surely, 2414231100424113 is an apocalyptic number.
It is an amenable number.
414231100424113 is a deficient number, since it is larger than the sum of its proper divisors (84107431011407).
414231100424113 is a wasteful number, since it uses less digits than its factorization.
414231100424113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96269436.
The product of its (nonzero) digits is 9216, while the sum is 31.
Adding to 414231100424113 its reverse (311424001132414), we get a palindrome (725655101556527).
The spelling of 414231100424113 in words is "four hundred fourteen trillion, two hundred thirty-one billion, one hundred million, four hundred twenty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •