Base | Representation |
---|---|
bin | 1000000011111100… |
… | …1111010011110111 |
3 | 12120211001201012101 |
4 | 2000333033103313 |
5 | 13412444431211 |
6 | 554423202531 |
7 | 104425135000 |
oct | 20077172367 |
9 | 5524051171 |
10 | 2164061431 |
11 | a10613424 |
12 | 5048a6447 |
13 | 28645a62c |
14 | 1675a41a7 |
15 | c9ebd5c1 |
hex | 80fcf4f7 |
2164061431 has 8 divisors (see below), whose sum is σ = 2523687200. Its totient is φ = 1854909504.
The previous prime is 2164061429. The next prime is 2164061441. The reversal of 2164061431 is 1341604612.
It is not a de Polignac number, because 2164061431 - 21 = 2164061429 is a prime.
It is a super-2 number, since 2×21640614312 = 9366323754283535522, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2164061431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2164061441) 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, 3154266 + ... + 3154951.
It is an arithmetic number, because the mean of its divisors is an integer number (315460900).
Almost surely, 22164061431 is an apocalyptic number.
2164061431 is a deficient number, since it is larger than the sum of its proper divisors (359625769).
2164061431 is an frugal number, since it uses more digits than its factorization.
2164061431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6309238 (or 6309224 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 28.
The square root of 2164061431 is about 46519.4736750106. The cubic root of 2164061431 is about 1293.4705000672.
The spelling of 2164061431 in words is "two billion, one hundred sixty-four million, sixty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •