Base | Representation |
---|---|
bin | 100011001110111011011… |
… | …111001100010101011111 |
3 | 22120110120102201202100112 |
4 | 203032323133030111133 |
5 | 304132120244312111 |
6 | 5052142310120235 |
7 | 336632615213000 |
oct | 43167337142537 |
9 | 8513512652315 |
10 | 2421212104031 |
11 | 853915125976 |
12 | 3312b705007b |
13 | 14741c71bc56 |
14 | 85289cd91a7 |
15 | 42eabc6de8b |
hex | 233bb7cc55f |
2421212104031 has 16 divisors (see below), whose sum is σ = 2825491046400. Its totient is φ = 2073913402680.
The previous prime is 2421212104013. The next prime is 2421212104093. The reversal of 2421212104031 is 1304012121242.
It is not a de Polignac number, because 2421212104031 - 234 = 2404032234847 is a prime.
It is a super-2 number, since 2×24212121040312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2421212103988 and 2421212104006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2421212101031) 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, 1894811 + ... + 2903916.
It is an arithmetic number, because the mean of its divisors is an integer number (176593190400).
Almost surely, 22421212104031 is an apocalyptic number.
2421212104031 is a deficient number, since it is larger than the sum of its proper divisors (404278942369).
2421212104031 is an equidigital number, since it uses as much as digits as its factorization.
2421212104031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4800219 (or 4800205 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 2421212104031 its reverse (1304012121242), we get a palindrome (3725224225273).
The spelling of 2421212104031 in words is "two trillion, four hundred twenty-one billion, two hundred twelve million, one hundred four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •