Base | Representation |
---|---|
bin | 1000000101011110… |
… | …1010111101010011 |
3 | 12121021010002210111 |
4 | 2001113222331103 |
5 | 13421114404011 |
6 | 555212342151 |
7 | 104533441411 |
oct | 20127527523 |
9 | 5537102714 |
10 | 2170466131 |
11 | a14198369 |
12 | 506a74957 |
13 | 2878908b2 |
14 | 1683902b1 |
15 | ca836121 |
hex | 815eaf53 |
2170466131 has 4 divisors (see below), whose sum is σ = 2183012352. Its totient is φ = 2157919912.
The previous prime is 2170466087. The next prime is 2170466141. The reversal of 2170466131 is 1316640712.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2170466131 - 219 = 2169941843 is a prime.
It is a super-2 number, since 2×21704661312 = 9421846451636218322, 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 = 2170466093 and 2170466102.
It is not an unprimeable number, because it can be changed into a prime (2170466141) 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 3 ways as a sum of consecutive naturals, for example, 6272851 + ... + 6273196.
It is an arithmetic number, because the mean of its divisors is an integer number (545753088).
Almost surely, 22170466131 is an apocalyptic number.
2170466131 is a deficient number, since it is larger than the sum of its proper divisors (12546221).
2170466131 is a wasteful number, since it uses less digits than its factorization.
2170466131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12546220.
The product of its (nonzero) digits is 6048, while the sum is 31.
The square root of 2170466131 is about 46588.2617297533. The cubic root of 2170466131 is about 1294.7452838522.
The spelling of 2170466131 in words is "two billion, one hundred seventy million, four hundred sixty-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •