Base | Representation |
---|---|
bin | 111101000011001… |
… | …000001011110011 |
3 | 2122101021021121022 |
4 | 331003020023303 |
5 | 4044200331011 |
6 | 245344450055 |
7 | 34244545451 |
oct | 7503101363 |
9 | 2571237538 |
10 | 1024230131 |
11 | 486173291 |
12 | 24701992b |
13 | 134271b42 |
14 | 9a0579d1 |
15 | 5edba8db |
hex | 3d0c82f3 |
1024230131 has 8 divisors (see below), whose sum is σ = 1085280000. Its totient is φ = 963894600.
The previous prime is 1024230121. The next prime is 1024230191. The reversal of 1024230131 is 1310324201.
1024230131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 1024230131 - 214 = 1024213747 is a prime.
It is a super-2 number, since 2×10242301312 = 2098094722496554322, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1024230121) 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, 175631 + ... + 181368.
It is an arithmetic number, because the mean of its divisors is an integer number (135660000).
Almost surely, 21024230131 is an apocalyptic number.
1024230131 is a deficient number, since it is larger than the sum of its proper divisors (61049869).
1024230131 is a wasteful number, since it uses less digits than its factorization.
1024230131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 357169.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 1024230131 is about 32003.5955948703. The cubic root of 1024230131 is about 1008.0123412631.
Adding to 1024230131 its reverse (1310324201), we get a palindrome (2334554332).
The spelling of 1024230131 in words is "one billion, twenty-four million, two hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •