Base | Representation |
---|---|
bin | 111010110010000… |
… | …1111110010100011 |
3 | 12002110111010201001 |
4 | 1311210033302203 |
5 | 13014420424011 |
6 | 523420052431 |
7 | 66610300441 |
oct | 16544176243 |
9 | 5073433631 |
10 | 1972436131 |
11 | 922430506 |
12 | 470694117 |
13 | 255846193 |
14 | 149d61b91 |
15 | b826a7c1 |
hex | 7590fca3 |
1972436131 has 8 divisors (see below), whose sum is σ = 2058511680. Its totient is φ = 1887564672.
The previous prime is 1972436117. The next prime is 1972436173. The reversal of 1972436131 is 1316342791.
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 1972436131 - 25 = 1972436099 is a prime.
It is a super-2 number, since 2×19724361312 = 7781008581748498322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1972436731) 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, 297675 + ... + 304228.
It is an arithmetic number, because the mean of its divisors is an integer number (257313960).
Almost surely, 21972436131 is an apocalyptic number.
1972436131 is a deficient number, since it is larger than the sum of its proper divisors (86075549).
1972436131 is a wasteful number, since it uses less digits than its factorization.
1972436131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 602045.
The product of its digits is 27216, while the sum is 37.
The square root of 1972436131 is about 44412.1169389616. The cubic root of 1972436131 is about 1254.1062044447.
It can be divided in two parts, 19724 and 36131, that added together give a palindrome (55855).
The spelling of 1972436131 in words is "one billion, nine hundred seventy-two million, four hundred thirty-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •