Base | Representation |
---|---|
bin | 11101001000100100100… |
… | …11010001010010100101 |
3 | 10112200211210212110220020 |
4 | 32210102103101102211 |
5 | 112400104302441123 |
6 | 2043511401425353 |
7 | 132215365121625 |
oct | 16442223212245 |
9 | 3480753773806 |
10 | 1001034421413 |
11 | 35659991a024 |
12 | 14201049b259 |
13 | 73521698310 |
14 | 36643994885 |
15 | 1b08c4967e3 |
hex | e9124d14a5 |
1001034421413 has 32 divisors (see below), whose sum is σ = 1473150645120. Its totient is φ = 600706575360.
The previous prime is 1001034421381. The next prime is 1001034421421. The reversal of 1001034421413 is 3141244301001.
It is not a de Polignac number, because 1001034421413 - 25 = 1001034421381 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1001034421463) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3190470 + ... + 3490152.
It is an arithmetic number, because the mean of its divisors is an integer number (46035957660).
Almost surely, 21001034421413 is an apocalyptic number.
1001034421413 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1001034421413 is a deficient number, since it is larger than the sum of its proper divisors (472116223707).
1001034421413 is a wasteful number, since it uses less digits than its factorization.
1001034421413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 301829.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 1001034421413 its reverse (3141244301001), we get a palindrome (4142278722414).
The spelling of 1001034421413 in words is "one trillion, one billion, thirty-four million, four hundred twenty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •