Base | Representation |
---|---|
bin | 1001000100010110… |
… | …1111011000101011 |
3 | 20021122101020012110 |
4 | 2101011233120223 |
5 | 14441123414011 |
6 | 1041313213403 |
7 | 114215240205 |
oct | 22105573053 |
9 | 6248336173 |
10 | 2434201131 |
11 | 103a05237a |
12 | 57b261263 |
13 | 2ca401bcb |
14 | 191403775 |
15 | e3a7eba6 |
hex | 9116f62b |
2434201131 has 32 divisors (see below), whose sum is σ = 3453926400. Its totient is φ = 1520618400.
The previous prime is 2434201097. The next prime is 2434201181. The reversal of 2434201131 is 1311024342.
2434201131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2434201131 - 29 = 2434200619 is a prime.
It is a super-2 number, since 2×24342011312 = 11850670292323358322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2434201098 and 2434201107.
It is not an unprimeable number, because it can be changed into a prime (2434201181) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2315556 + ... + 2316606.
It is an arithmetic number, because the mean of its divisors is an integer number (107935200).
Almost surely, 22434201131 is an apocalyptic number.
2434201131 is a deficient number, since it is larger than the sum of its proper divisors (1019725269).
2434201131 is a wasteful number, since it uses less digits than its factorization.
2434201131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1479.
The product of its (nonzero) digits is 576, while the sum is 21.
The square root of 2434201131 is about 49337.6238888741. The cubic root of 2434201131 is about 1345.1957502667.
Adding to 2434201131 its reverse (1311024342), we get a palindrome (3745225473).
The spelling of 2434201131 in words is "two billion, four hundred thirty-four million, two hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •