Base | Representation |
---|---|
bin | 1001000011101001… |
… | …0011101010111111 |
3 | 20021102201221221202 |
4 | 2100322103222333 |
5 | 14434342012111 |
6 | 1041125050115 |
7 | 114150615254 |
oct | 22072235277 |
9 | 6242657852 |
10 | 2431204031 |
11 | 1038395633 |
12 | 57a25693b |
13 | 2c98c2989 |
14 | 190c6342b |
15 | e368bb3b |
hex | 90e93abf |
2431204031 has 8 divisors (see below), whose sum is σ = 2455097040. Its totient is φ = 2407332928.
The previous prime is 2431204001. The next prime is 2431204043. The reversal of 2431204031 is 1304021342.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2431204031 - 26 = 2431203967 is a prime.
It is a super-2 number, since 2×24312040312 = 11821506080701297922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2431203994 and 2431204012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2431204001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 299555 + ... + 307563.
It is an arithmetic number, because the mean of its divisors is an integer number (306887130).
Almost surely, 22431204031 is an apocalyptic number.
2431204031 is a deficient number, since it is larger than the sum of its proper divisors (23893009).
2431204031 is a wasteful number, since it uses less digits than its factorization.
2431204031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10953.
The product of its (nonzero) digits is 576, while the sum is 20.
The square root of 2431204031 is about 49307.2411619227. The cubic root of 2431204031 is about 1344.6434346384.
Adding to 2431204031 its reverse (1304021342), we get a palindrome (3735225373).
The spelling of 2431204031 in words is "two billion, four hundred thirty-one million, two hundred four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •