Base | Representation |
---|---|
bin | 11101000110101001011… |
… | …10010011100101100001 |
3 | 10112121011210220112222120 |
4 | 32203110232103211201 |
5 | 112341000314240223 |
6 | 2043221054454453 |
7 | 132150651661161 |
oct | 16432456234541 |
9 | 3477153815876 |
10 | 1000001321313 |
11 | 356109748695 |
12 | 141982504429 |
13 | 733b863c097 |
14 | 365866ac5a1 |
15 | 1b02b927be3 |
hex | e8d4b93961 |
1000001321313 has 8 divisors (see below), whose sum is σ = 1339157520000. Its totient is φ = 663756335088.
The previous prime is 1000001321299. The next prime is 1000001321323. The reversal of 1000001321313 is 3131231000001.
1000001321313 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1000001321313 - 220 = 1000000272737 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1000001321292 and 1000001321301.
It is not an unprimeable number, because it can be changed into a prime (1000001321323) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 727802313 + ... + 727803686.
It is an arithmetic number, because the mean of its divisors is an integer number (167394690000).
Almost surely, 21000001321313 is an apocalyptic number.
It is an amenable number.
1000001321313 is a deficient number, since it is larger than the sum of its proper divisors (339156198687).
1000001321313 is a wasteful number, since it uses less digits than its factorization.
1000001321313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1455606231.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 1000001321313 its reverse (3131231000001), we get a palindrome (4131232321314).
The spelling of 1000001321313 in words is "one trillion, one million, three hundred twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •