Base | Representation |
---|---|
bin | 11101101011111011001… |
… | …00101010011001101101 |
3 | 10121111211112022120121020 |
4 | 32311331210222121231 |
5 | 113202442041341023 |
6 | 2100331000124353 |
7 | 133456620022203 |
oct | 16657544523155 |
9 | 3544745276536 |
10 | 1020014012013 |
11 | 363649355397 |
12 | 1458287666b9 |
13 | 7525783b1b9 |
14 | 37524539073 |
15 | 1b7ed84dde3 |
hex | ed7d92a66d |
1020014012013 has 8 divisors (see below), whose sum is σ = 1363607124000. Its totient is φ = 678215120688.
The previous prime is 1020014012009. The next prime is 1020014012071. The reversal of 1020014012013 is 3102104100201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1020014012013 - 22 = 1020014012009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1020014011983 and 1020014012001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020014011013) 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, 448553838 + ... + 448556111.
It is an arithmetic number, because the mean of its divisors is an integer number (170450890500).
Almost surely, 21020014012013 is an apocalyptic number.
It is an amenable number.
1020014012013 is a deficient number, since it is larger than the sum of its proper divisors (343593111987).
1020014012013 is an equidigital number, since it uses as much as digits as its factorization.
1020014012013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 897110331.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 1020014012013 its reverse (3102104100201), we get a palindrome (4122118112214).
The spelling of 1020014012013 in words is "one trillion, twenty billion, fourteen million, twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •