Base | Representation |
---|---|
bin | 111100011001011… |
… | …100110001010001 |
3 | 2121121201012022122 |
4 | 330121130301101 |
5 | 4033401220101 |
6 | 244314344025 |
7 | 34052642144 |
oct | 7431346121 |
9 | 2547635278 |
10 | 1013304401 |
11 | 47aa9065a |
12 | 24342b015 |
13 | 131c17b05 |
14 | 9881205b |
15 | 5de5d51b |
hex | 3c65cc51 |
1013304401 has 2 divisors, whose sum is σ = 1013304402. Its totient is φ = 1013304400.
The previous prime is 1013304359. The next prime is 1013304451. The reversal of 1013304401 is 1044033101.
1013304401 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 997296400 + 16008001 = 31580^2 + 4001^2 .
It is a cyclic number.
It is not a de Polignac number, because 1013304401 - 26 = 1013304337 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1013304401.
It is not a weakly prime, because it can be changed into another prime (1013304451) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506652200 + 506652201.
It is an arithmetic number, because the mean of its divisors is an integer number (506652201).
Almost surely, 21013304401 is an apocalyptic number.
It is an amenable number.
1013304401 is a deficient number, since it is larger than the sum of its proper divisors (1).
1013304401 is an equidigital number, since it uses as much as digits as its factorization.
1013304401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 1013304401 is about 31832.4425861416. The cubic root of 1013304401 is about 1004.4152769711.
Adding to 1013304401 its reverse (1044033101), we get a palindrome (2057337502).
The spelling of 1013304401 in words is "one billion, thirteen million, three hundred four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •