Base | Representation |
---|---|
bin | 1101000110011101001… |
… | …00101100001000011111 |
3 | 1121000220012012022101110 |
4 | 12203032210230020133 |
5 | 24333342413320411 |
6 | 542443104113103 |
7 | 44343642421206 |
oct | 6431644541037 |
9 | 1530805168343 |
10 | 450142323231 |
11 | 1639a4673a57 |
12 | 732a7905793 |
13 | 335a9a1c9a3 |
14 | 17b0378023d |
15 | ba98a032a6 |
hex | 68ce92c21f |
450142323231 has 8 divisors (see below), whose sum is σ = 603659070000. Its totient is φ = 298360229312.
The previous prime is 450142323217. The next prime is 450142323259. The reversal of 450142323231 is 132323241054.
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 450142323231 - 29 = 450142322719 is a prime.
It is a super-2 number, since 2×4501423232312 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (450142323931) 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 7 ways as a sum of consecutive naturals, for example, 433662606 + ... + 433663643.
It is an arithmetic number, because the mean of its divisors is an integer number (75457383750).
Almost surely, 2450142323231 is an apocalyptic number.
450142323231 is a deficient number, since it is larger than the sum of its proper divisors (153516746769).
450142323231 is a wasteful number, since it uses less digits than its factorization.
450142323231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 867326425.
The product of its (nonzero) digits is 17280, while the sum is 30.
Adding to 450142323231 its reverse (132323241054), we get a palindrome (582465564285).
The spelling of 450142323231 in words is "four hundred fifty billion, one hundred forty-two million, three hundred twenty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •