Base | Representation |
---|---|
bin | 111100011001001… |
… | …010100111000101 |
3 | 2121121120102021211 |
4 | 330121022213011 |
5 | 4033341330041 |
6 | 244313011421 |
7 | 34052212246 |
oct | 7431124705 |
9 | 2547512254 |
10 | 1013230021 |
11 | 47aa3a791 |
12 | 2433b3b71 |
13 | 131bbccbb |
14 | 987d2ccd |
15 | 5de46481 |
hex | 3c64a9c5 |
1013230021 has 2 divisors, whose sum is σ = 1013230022. Its totient is φ = 1013230020.
The previous prime is 1013229977. The next prime is 1013230061. The reversal of 1013230021 is 1200323101.
1013230021 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 557620996 + 455609025 = 23614^2 + 21345^2 .
It is a cyclic number.
It is not a de Polignac number, because 1013230021 - 217 = 1013098949 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1013229983 and 1013230010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1013230061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506615010 + 506615011.
It is an arithmetic number, because the mean of its divisors is an integer number (506615011).
Almost surely, 21013230021 is an apocalyptic number.
It is an amenable number.
1013230021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1013230021 is an equidigital number, since it uses as much as digits as its factorization.
1013230021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 1013230021 is about 31831.2742597591. The cubic root of 1013230021 is about 1004.3907005338.
Adding to 1013230021 its reverse (1200323101), we get a palindrome (2213553122).
The spelling of 1013230021 in words is "one billion, thirteen million, two hundred thirty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •