Base | Representation |
---|---|
bin | 111100011011101… |
… | …001011100011001 |
3 | 2121122210110201101 |
4 | 330123221130121 |
5 | 4034023134401 |
6 | 244334551401 |
7 | 34060562056 |
oct | 7433513431 |
9 | 2548713641 |
10 | 1013880601 |
11 | 480344558 |
12 | 243668561 |
13 | 13208a166 |
14 | 9892202d |
15 | 5e024101 |
hex | 3c6e9719 |
1013880601 has 2 divisors, whose sum is σ = 1013880602. Its totient is φ = 1013880600.
The previous prime is 1013880587. The next prime is 1013880631. The reversal of 1013880601 is 1060883101.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1011558025 + 2322576 = 31805^2 + 1524^2 .
It is an emirp because it is prime and its reverse (1060883101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1013880601 - 215 = 1013847833 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1013880601.
It is not a weakly prime, because it can be changed into another prime (1013880631) 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 as a sum of consecutive naturals, namely, 506940300 + 506940301.
It is an arithmetic number, because the mean of its divisors is an integer number (506940301).
Almost surely, 21013880601 is an apocalyptic number.
It is an amenable number.
1013880601 is a deficient number, since it is larger than the sum of its proper divisors (1).
1013880601 is an equidigital number, since it uses as much as digits as its factorization.
1013880601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 28.
The square root of 1013880601 is about 31841.4918149260. The cubic root of 1013880601 is about 1004.6056226753.
The spelling of 1013880601 in words is "one billion, thirteen million, eight hundred eighty thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •