Base | Representation |
---|---|
bin | 111100011000101… |
… | …011001100000001 |
3 | 2121121022212201212 |
4 | 330120223030001 |
5 | 4033323220223 |
6 | 244310135505 |
7 | 34051135100 |
oct | 7430531401 |
9 | 2547285655 |
10 | 1013101313 |
11 | 47a962014 |
12 | 243351595 |
13 | 131b76543 |
14 | 9879c037 |
15 | 5de1d278 |
hex | 3c62b301 |
1013101313 has 6 divisors (see below), whose sum is σ = 1178505666. Its totient is φ = 868372512.
The previous prime is 1013101303. The next prime is 1013101333. The reversal of 1013101313 is 3131013101.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 844309249 + 168792064 = 29057^2 + 12992^2 .
It is not a de Polignac number, because 1013101313 - 28 = 1013101057 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1013101303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 10337720 + ... + 10337817.
It is an arithmetic number, because the mean of its divisors is an integer number (196417611).
Almost surely, 21013101313 is an apocalyptic number.
It is an amenable number.
1013101313 is a deficient number, since it is larger than the sum of its proper divisors (165404353).
1013101313 is an equidigital number, since it uses as much as digits as its factorization.
1013101313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20675551 (or 20675544 counting only the distinct ones).
The product of its (nonzero) digits is 27, while the sum is 14.
The square root of 1013101313 is about 31829.2524731575. The cubic root of 1013101313 is about 1004.3481703450.
Adding to 1013101313 its reverse (3131013101), we get a palindrome (4144114414).
The spelling of 1013101313 in words is "one billion, thirteen million, one hundred one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •