Base | Representation |
---|---|
bin | 111100010100111… |
… | …0111101111010011 |
3 | 12020001222011011210 |
4 | 1320221313233103 |
5 | 13121201222011 |
6 | 532510311203 |
7 | 101106526362 |
oct | 17051675723 |
9 | 5201864153 |
10 | 2024242131 |
11 | 9496a508a |
12 | 485ab8503 |
13 | 2634b4612 |
14 | 152ba97d9 |
15 | bcaa06a6 |
hex | 78a77bd3 |
2024242131 has 4 divisors (see below), whose sum is σ = 2698989512. Its totient is φ = 1349494752.
The previous prime is 2024242109. The next prime is 2024242133. The reversal of 2024242131 is 1312424202.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 2024242131 - 29 = 2024241619 is a prime.
It is a super-3 number, since 3×20242421313 (a number of 29 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2024242098 and 2024242107.
It is not an unprimeable number, because it can be changed into a prime (2024242133) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 337373686 + ... + 337373691.
It is an arithmetic number, because the mean of its divisors is an integer number (674747378).
Almost surely, 22024242131 is an apocalyptic number.
2024242131 is a deficient number, since it is larger than the sum of its proper divisors (674747381).
2024242131 is an equidigital number, since it uses as much as digits as its factorization.
2024242131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 674747380.
The product of its (nonzero) digits is 768, while the sum is 21.
The square root of 2024242131 is about 44991.5784453046. The cubic root of 2024242131 is about 1264.9911482662.
Adding to 2024242131 its reverse (1312424202), we get a palindrome (3336666333).
The spelling of 2024242131 in words is "two billion, twenty-four million, two hundred forty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •