Base | Representation |
---|---|
bin | 111100011001100… |
… | …000110100110101 |
3 | 2121121202001002220 |
4 | 330121200310311 |
5 | 4033402233023 |
6 | 244314552553 |
7 | 34053041445 |
oct | 7431406465 |
9 | 2547661086 |
10 | 1013321013 |
11 | 47aaa2091 |
12 | 243438759 |
13 | 131c22543 |
14 | 98818125 |
15 | 5de633e3 |
hex | 3c660d35 |
1013321013 has 8 divisors (see below), whose sum is σ = 1351298688. Its totient is φ = 675445344.
The previous prime is 1013321011. The next prime is 1013321033. The reversal of 1013321013 is 3101233101.
1013321013 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 1013321013 - 21 = 1013321011 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1013320983 and 1013321001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1013321011) 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, 1881 + ... + 45057.
It is an arithmetic number, because the mean of its divisors is an integer number (168912336).
Almost surely, 21013321013 is an apocalyptic number.
It is an amenable number.
1013321013 is a deficient number, since it is larger than the sum of its proper divisors (337977675).
1013321013 is an equidigital number, since it uses as much as digits as its factorization.
1013321013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51003.
The product of its (nonzero) digits is 54, while the sum is 15.
The square root of 1013321013 is about 31832.7035138393. The cubic root of 1013321013 is about 1004.4207656987.
Adding to 1013321013 its reverse (3101233101), we get a palindrome (4114554114).
The spelling of 1013321013 in words is "one billion, thirteen million, three hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •