Base | Representation |
---|---|
bin | 111101101101000… |
… | …1111110100100000 |
3 | 12100021222012000112 |
4 | 1323122033310200 |
5 | 13220020244422 |
6 | 541241310452 |
7 | 102210526223 |
oct | 17332176440 |
9 | 5307865015 |
10 | 2070478112 |
11 | 97280493a |
12 | 499495428 |
13 | 26cc526a1 |
14 | 158da35ba |
15 | c1b84ee2 |
hex | 7b68fd20 |
2070478112 has 12 divisors (see below), whose sum is σ = 4076253846. Its totient is φ = 1035239040.
The previous prime is 2070478097. The next prime is 2070478117. The reversal of 2070478112 is 2118740702.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 1505750416 + 564727696 = 38804^2 + 23764^2 .
It is a super-2 number, since 2×20704781122 = 8573759224542169088, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (32), and also a Moran number because the ratio is a prime number: 64702441 = 2070478112 / (2 + 0 + 7 + 0 + 4 + 7 + 8 + 1 + 1 + 2).
It is not an unprimeable number, because it can be changed into a prime (2070478117) 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 as a sum of consecutive naturals, namely, 32351189 + ... + 32351252.
Almost surely, 22070478112 is an apocalyptic number.
It is an amenable number.
2070478112 is a deficient number, since it is larger than the sum of its proper divisors (2005775734).
2070478112 is an equidigital number, since it uses as much as digits as its factorization.
2070478112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64702451 (or 64702443 counting only the distinct ones).
The product of its (nonzero) digits is 6272, while the sum is 32.
The square root of 2070478112 is about 45502.5066562272. The cubic root of 2070478112 is about 1274.5500115480.
The spelling of 2070478112 in words is "two billion, seventy million, four hundred seventy-eight thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •