Base | Representation |
---|---|
bin | 101000010100101… |
… | …1101101110111101 |
3 | 10111021222220111212 |
4 | 1100221131232331 |
5 | 10232340000343 |
6 | 342132254205 |
7 | 45346465235 |
oct | 12051355675 |
9 | 3437886455 |
10 | 1353046973 |
11 | 63483a243 |
12 | 319171365 |
13 | 18741c215 |
14 | cb9accc5 |
15 | 7dbbcc18 |
hex | 50a5dbbd |
1353046973 has 2 divisors, whose sum is σ = 1353046974. Its totient is φ = 1353046972.
The previous prime is 1353046963. The next prime is 1353046999. The reversal of 1353046973 is 3796403531.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1093095844 + 259951129 = 33062^2 + 16123^2 .
It is a cyclic number.
It is not a de Polignac number, because 1353046973 - 210 = 1353045949 is a prime.
It is a super-2 number, since 2×13530469732 = 3661472222288925458, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1353046973.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1353046913) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 676523486 + 676523487.
It is an arithmetic number, because the mean of its divisors is an integer number (676523487).
Almost surely, 21353046973 is an apocalyptic number.
It is an amenable number.
1353046973 is a deficient number, since it is larger than the sum of its proper divisors (1).
1353046973 is an equidigital number, since it uses as much as digits as its factorization.
1353046973 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 204120, while the sum is 41.
The square root of 1353046973 is about 36783.7868224575. The cubic root of 1353046973 is about 1106.0403169971.
The spelling of 1353046973 in words is "one billion, three hundred fifty-three million, forty-six thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •