Base | Representation |
---|---|
bin | 111110101101000… |
… | …1010100111011111 |
3 | 12102122001211210220 |
4 | 1331122022213133 |
5 | 13302111324411 |
6 | 544440132423 |
7 | 103065541350 |
oct | 17532124737 |
9 | 5378054726 |
10 | 2104011231 |
11 | 98a728863 |
12 | 4a8767113 |
13 | 276b9387a |
14 | 15d611d27 |
15 | c4aaab06 |
hex | 7d68a9df |
2104011231 has 16 divisors (see below), whose sum is σ = 3251271168. Its totient is φ = 1185357600.
The previous prime is 2104011211. The next prime is 2104011257. The reversal of 2104011231 is 1321104012.
It is not a de Polignac number, because 2104011231 - 26 = 2104011167 is a prime.
It is a super-2 number, since 2×21040112312 = 8853726520348270722, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2104011231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2104011211) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 704080 + ... + 707061.
It is an arithmetic number, because the mean of its divisors is an integer number (203204448).
Almost surely, 22104011231 is an apocalyptic number.
2104011231 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
2104011231 is a deficient number, since it is larger than the sum of its proper divisors (1147259937).
2104011231 is a wasteful number, since it uses less digits than its factorization.
2104011231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1411222.
The product of its (nonzero) digits is 48, while the sum is 15.
The square root of 2104011231 is about 45869.5021882732. The cubic root of 2104011231 is about 1281.3939954252.
Adding to 2104011231 its reverse (1321104012), we get a palindrome (3425115243).
The spelling of 2104011231 in words is "two billion, one hundred four million, eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •