Base | Representation |
---|---|
bin | 111111100001010… |
… | …1100010000100000 |
3 | 12111112121221121012 |
4 | 1333002230100200 |
5 | 13331120141000 |
6 | 551255320052 |
7 | 103550463104 |
oct | 17702542040 |
9 | 5445557535 |
10 | 2131412000 |
11 | 9a4143423 |
12 | 4b5980028 |
13 | 27c768743 |
14 | 163105904 |
15 | c71be735 |
hex | 7f0ac420 |
2131412000 has 48 divisors (see below), whose sum is σ = 5236889112. Its totient is φ = 852563200.
The previous prime is 2131411991. The next prime is 2131412053. The reversal of 2131412000 is 2141312.
It can be written as a sum of positive squares in 4 ways, for example, as 461218576 + 1670193424 = 21476^2 + 40868^2 .
It is a super-2 number, since 2×21314120002 = 9085834227488000000, which contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 262427 + ... + 270426.
Almost surely, 22131412000 is an apocalyptic number.
2131412000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2131412000 is an abundant number, since it is smaller than the sum of its proper divisors (3105477112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2131412000 is an equidigital number, since it uses as much as digits as its factorization.
2131412000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 532878 (or 532860 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 2131412000 is about 46167.2178065779. The cubic root of 2131412000 is about 1286.9325994511.
Adding to 2131412000 its reverse (2141312), we get a palindrome (2133553312).
The spelling of 2131412000 in words is "two billion, one hundred thirty-one million, four hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •