Base | Representation |
---|---|
bin | 111100001101111… |
… | …111100110000001 |
3 | 2121102001121212011 |
4 | 330031333212001 |
5 | 4032114120223 |
6 | 244130132521 |
7 | 34015263610 |
oct | 7415774601 |
9 | 2542047764 |
10 | 1010301313 |
11 | 47931a36a |
12 | 242421141 |
13 | 131405c38 |
14 | 9826d877 |
15 | 5da6880d |
hex | 3c37f981 |
1010301313 has 8 divisors (see below), whose sum is σ = 1222549632. Its totient is φ = 815032896.
The previous prime is 1010301311. The next prime is 1010301319. The reversal of 1010301313 is 3131030101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1010301313 - 21 = 1010301311 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1010301293 and 1010301302.
It is not an unprimeable number, because it can be changed into a prime (1010301311) 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 7 ways as a sum of consecutive naturals, for example, 4244845 + ... + 4245082.
It is an arithmetic number, because the mean of its divisors is an integer number (152818704).
Almost surely, 21010301313 is an apocalyptic number.
It is an amenable number.
1010301313 is a deficient number, since it is larger than the sum of its proper divisors (212248319).
1010301313 is an equidigital number, since it uses as much as digits as its factorization.
1010301313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8489951.
The product of its (nonzero) digits is 27, while the sum is 13.
The square root of 1010301313 is about 31785.2373437733. The cubic root of 1010301313 is about 1003.4220472349.
Adding to 1010301313 its reverse (3131030101), we get a palindrome (4141331414).
The spelling of 1010301313 in words is "one billion, ten million, three hundred one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •