Base | Representation |
---|---|
bin | 11101011101010111110… |
… | …000110101000011011111 |
3 | 21011112100001112121210100 |
4 | 131131113300311003133 |
5 | 231131433403430211 |
6 | 4145555240512143 |
7 | 266154366130206 |
oct | 35352760650337 |
9 | 7145301477710 |
10 | 2024402014431 |
11 | 7105a9185465 |
12 | 28841417b653 |
13 | 118b91c28b74 |
14 | 6dda565623d |
15 | 379d542e156 |
hex | 1d757c350df |
2024402014431 has 6 divisors (see below), whose sum is σ = 2924136243080. Its totient is φ = 1349601342948.
The previous prime is 2024402014399. The next prime is 2024402014441. The reversal of 2024402014431 is 1344102044202.
2024402014431 is a `hidden beast` number, since 2 + 0 + 24 + 4 + 0 + 201 + 4 + 431 = 666.
It is not a de Polignac number, because 2024402014431 - 25 = 2024402014399 is a prime.
It is a super-2 number, since 2×20244020144312 (a number of 25 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 = 2024402014395 and 2024402014404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2024402014441) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 112466778571 + ... + 112466778588.
Almost surely, 22024402014431 is an apocalyptic number.
2024402014431 is a deficient number, since it is larger than the sum of its proper divisors (899734228649).
2024402014431 is a wasteful number, since it uses less digits than its factorization.
2024402014431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 224933557165 (or 224933557162 counting only the distinct ones).
The product of its (nonzero) digits is 6144, while the sum is 27.
Adding to 2024402014431 its reverse (1344102044202), we get a palindrome (3368504058633).
The spelling of 2024402014431 in words is "two trillion, twenty-four billion, four hundred two million, fourteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •