Base | Representation |
---|---|
bin | 11101000110101001011… |
… | …10001111011101011101 |
3 | 10112121011210212200210122 |
4 | 32203110232033131131 |
5 | 112341000313220123 |
6 | 2043221054244325 |
7 | 132150651560666 |
oct | 16432456173535 |
9 | 3477153780718 |
10 | 1000001304413 |
11 | 356109736a21 |
12 | 1419824b66a5 |
13 | 733b8634497 |
14 | 365866a636d |
15 | 1b02b922bc8 |
hex | e8d4b8f75d |
1000001304413 has 4 divisors (see below), whose sum is σ = 1007875330560. Its totient is φ = 992127278268.
The previous prime is 1000001304403. The next prime is 1000001304461. The reversal of 1000001304413 is 3144031000001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1000001304413 - 26 = 1000001304349 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1000001304391 and 1000001304400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1000001304403) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3937012883 + ... + 3937013136.
It is an arithmetic number, because the mean of its divisors is an integer number (251968832640).
Almost surely, 21000001304413 is an apocalyptic number.
It is an amenable number.
1000001304413 is a deficient number, since it is larger than the sum of its proper divisors (7874026147).
1000001304413 is an equidigital number, since it uses as much as digits as its factorization.
1000001304413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7874026146.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 1000001304413 its reverse (3144031000001), we get a palindrome (4144032304414).
The spelling of 1000001304413 in words is "one trillion, one million, three hundred four thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •