Base | Representation |
---|---|
bin | 1110110010100011… |
… | …1101100111100011 |
3 | 101020200120002012120 |
4 | 3230220331213203 |
5 | 31112330123443 |
6 | 1453542155323 |
7 | 200245545525 |
oct | 35450754743 |
9 | 11220502176 |
10 | 3970161123 |
11 | 17580638a5 |
12 | 929722b43 |
13 | 4b36a4b86 |
14 | 2993c7a15 |
15 | 18382e083 |
hex | eca3d9e3 |
3970161123 has 8 divisors (see below), whose sum is σ = 5523702528. Its totient is φ = 2531696904.
The previous prime is 3970161101. The next prime is 3970161133. The reversal of 3970161123 is 3211610793.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3970161123 - 29 = 3970160611 is a prime.
It is a super-2 number, since 2×39701611232 = 31524358685161242258, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (3970161133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 28769215 + ... + 28769352.
It is an arithmetic number, because the mean of its divisors is an integer number (690462816).
Almost surely, 23970161123 is an apocalyptic number.
3970161123 is a deficient number, since it is larger than the sum of its proper divisors (1553541405).
3970161123 is a wasteful number, since it uses less digits than its factorization.
3970161123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57538593.
The product of its (nonzero) digits is 6804, while the sum is 33.
The square root of 3970161123 is about 63009.2145880267. The cubic root of 3970161123 is about 1583.4440073872. Note that the first 3 decimals are identical.
The spelling of 3970161123 in words is "three billion, nine hundred seventy million, one hundred sixty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •