Base | Representation |
---|---|
bin | 1000000110010101… |
… | …1010110100001111 |
3 | 12121111220012102021 |
4 | 2001211122310033 |
5 | 13423030220111 |
6 | 555421511011 |
7 | 104606201410 |
oct | 20145326417 |
9 | 5544805367 |
10 | 2174070031 |
11 | a16229aa1 |
12 | 508112467 |
13 | 288553093 |
14 | 168a4b807 |
15 | cace8d71 |
hex | 8195ad0f |
2174070031 has 4 divisors (see below), whose sum is σ = 2484651472. Its totient is φ = 1863488592.
The previous prime is 2174070011. The next prime is 2174070043. The reversal of 2174070031 is 1300704712.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 2174070031 - 219 = 2173545743 is a prime.
It is a super-2 number, since 2×21740700312 = 9453160999384681922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2174069978 and 2174070005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2174070011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 155290710 + ... + 155290723.
It is an arithmetic number, because the mean of its divisors is an integer number (621162868).
Almost surely, 22174070031 is an apocalyptic number.
2174070031 is a deficient number, since it is larger than the sum of its proper divisors (310581441).
2174070031 is an equidigital number, since it uses as much as digits as its factorization.
2174070031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 310581440.
The product of its (nonzero) digits is 1176, while the sum is 25.
The square root of 2174070031 is about 46626.9238852404. The cubic root of 2174070031 is about 1295.4614974880.
Adding to 2174070031 its reverse (1300704712), we get a palindrome (3474774743).
The spelling of 2174070031 in words is "two billion, one hundred seventy-four million, seventy thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •