Base | Representation |
---|---|
bin | 1000100001011… |
… | …01101011001101 |
3 | 11222112002012011 |
4 | 10100231223031 |
5 | 121300142003 |
6 | 11032141221 |
7 | 1525441252 |
oct | 420555315 |
9 | 158462164 |
10 | 71490253 |
11 | 3739975a |
12 | 1bb37811 |
13 | 11a70c33 |
14 | 96cd429 |
15 | 642246d |
hex | 442dacd |
71490253 has 8 divisors (see below), whose sum is σ = 77742072. Its totient is φ = 65465856.
The previous prime is 71490239. The next prime is 71490257. The reversal of 71490253 is 35209417.
It can be written as a sum of positive squares in 4 ways, for example, as 48622729 + 22867524 = 6973^2 + 4782^2 .
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 71490253 - 29 = 71489741 is a prime.
It is a super-2 number, since 2×714902532 = 10221712548008018, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (71490257) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 56200 + ... + 57457.
It is an arithmetic number, because the mean of its divisors is an integer number (9717759).
Almost surely, 271490253 is an apocalyptic number.
It is an amenable number.
71490253 is a deficient number, since it is larger than the sum of its proper divisors (6251819).
71490253 is a wasteful number, since it uses less digits than its factorization.
71490253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113711.
The product of its (nonzero) digits is 7560, while the sum is 31.
The square root of 71490253 is about 8455.1908908078. The cubic root of 71490253 is about 415.0326639989.
The spelling of 71490253 in words is "seventy-one million, four hundred ninety thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •