Base | Representation |
---|---|
bin | 100101010101111… |
… | …0111011000010101 |
3 | 10020022202122201101 |
4 | 1022223313120111 |
5 | 10031232404023 |
6 | 324200230101 |
7 | 43023302110 |
oct | 11253673025 |
9 | 3208678641 |
10 | 1253013013 |
11 | 59332524a |
12 | 2ab76b331 |
13 | 16c796125 |
14 | bc5ad577 |
15 | 7500d1ad |
hex | 4aaf7615 |
1253013013 has 8 divisors (see below), whose sum is σ = 1466942400. Its totient is φ = 1047815520.
The previous prime is 1253012993. The next prime is 1253013019. The reversal of 1253013013 is 3103103521.
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 1253013013 - 217 = 1252881941 is a prime.
It is a super-2 number, since 2×12530130132 = 3140083221494676338, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1253013019) 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, 2182663 + ... + 2183236.
It is an arithmetic number, because the mean of its divisors is an integer number (183367800).
Almost surely, 21253013013 is an apocalyptic number.
It is an amenable number.
1253013013 is a deficient number, since it is larger than the sum of its proper divisors (213929387).
1253013013 is an equidigital number, since it uses as much as digits as its factorization.
1253013013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4365947.
The product of its (nonzero) digits is 270, while the sum is 19.
The square root of 1253013013 is about 35397.9238515481. The cubic root of 1253013013 is about 1078.0821624965.
Adding to 1253013013 its reverse (3103103521), we get a palindrome (4356116534).
The spelling of 1253013013 in words is "one billion, two hundred fifty-three million, thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •