Base | Representation |
---|---|
bin | 101111000100010100101000… |
… | …0010001001000111100110101 |
3 | 2000021220000021022011100102100 |
4 | 1132020221100101020330311 |
5 | 413231121322043413023 |
6 | 4024305432504532313 |
7 | 153130160155463463 |
oct | 13610512021107465 |
9 | 2007800238140370 |
10 | 414010424201013 |
11 | 10aa09920260842 |
12 | 3a525bb1481099 |
13 | 14a02028025083 |
14 | 74342d62dd833 |
15 | 32ce56427dc43 |
hex | 1788a50448f35 |
414010424201013 has 24 divisors (see below), whose sum is σ = 625619865461760. Its totient is φ = 263327966938080.
The previous prime is 414010424200963. The next prime is 414010424201069. The reversal of 414010424201013 is 310102424010414.
414010424201013 is a `hidden beast` number, since 4 + 1 + 401 + 0 + 4 + 242 + 0 + 1 + 0 + 13 = 666.
It is not a de Polignac number, because 414010424201013 - 28 = 414010424200757 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (414010424201093) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2570678293 + ... + 2570839338.
It is an arithmetic number, because the mean of its divisors is an integer number (26067494394240).
Almost surely, 2414010424201013 is an apocalyptic number.
It is an amenable number.
414010424201013 is a deficient number, since it is larger than the sum of its proper divisors (211609441260747).
414010424201013 is a wasteful number, since it uses less digits than its factorization.
414010424201013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5141518049 (or 5141518046 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 27.
Adding to 414010424201013 its reverse (310102424010414), we get a palindrome (724112848211427).
The spelling of 414010424201013 in words is "four hundred fourteen trillion, ten billion, four hundred twenty-four million, two hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •