Base | Representation |
---|---|
bin | 10101100110010101000… |
… | …10110101001100100011 |
3 | 2121221120111020022212021 |
4 | 22303022202311030203 |
5 | 44124341410101311 |
6 | 1324533031042311 |
7 | 104421510124132 |
oct | 12631242651443 |
9 | 2557514208767 |
10 | 742132503331 |
11 | 2668114a5a8a |
12 | bb9b6810397 |
13 | 54ca127a89b |
14 | 27cc2bbd919 |
15 | 14487dc7171 |
hex | acca8b5323 |
742132503331 has 4 divisors (see below), whose sum is σ = 742177207872. Its totient is φ = 742087798792.
The previous prime is 742132503323. The next prime is 742132503367. The reversal of 742132503331 is 133305231247.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 742132503331 - 23 = 742132503323 is a prime.
It is a super-2 number, since 2×7421325033312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (742132503311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22327360 + ... + 22360573.
It is an arithmetic number, because the mean of its divisors is an integer number (185544301968).
Almost surely, 2742132503331 is an apocalyptic number.
742132503331 is a deficient number, since it is larger than the sum of its proper divisors (44704541).
742132503331 is a wasteful number, since it uses less digits than its factorization.
742132503331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44704540.
The product of its (nonzero) digits is 45360, while the sum is 34.
Adding to 742132503331 its reverse (133305231247), we get a palindrome (875437734578).
The spelling of 742132503331 in words is "seven hundred forty-two billion, one hundred thirty-two million, five hundred three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •