Base | Representation |
---|---|
bin | 1101100011000111100… |
… | …00000110100011110011 |
3 | 1122111121120212101222112 |
4 | 12301203300012203303 |
5 | 30111401141202011 |
6 | 553510031555535 |
7 | 45430160620136 |
oct | 6614360064363 |
9 | 1574546771875 |
10 | 465530022131 |
11 | 16a480619989 |
12 | 7628108bbab |
13 | 34b8c991275 |
14 | 1876328621d |
15 | c19989b58b |
hex | 6c63c068f3 |
465530022131 has 4 divisors (see below), whose sum is σ = 465536291064. Its totient is φ = 465523753200.
The previous prime is 465530022079. The next prime is 465530022149. The reversal of 465530022131 is 131220035564.
It is a happy number.
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 465530022131 - 230 = 464456280307 is a prime.
It is a super-2 number, since 2×4655300221312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (465530022161) 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, 3021725 + ... + 3172046.
It is an arithmetic number, because the mean of its divisors is an integer number (116384072766).
Almost surely, 2465530022131 is an apocalyptic number.
465530022131 is a deficient number, since it is larger than the sum of its proper divisors (6268933).
465530022131 is an equidigital number, since it uses as much as digits as its factorization.
465530022131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6268932.
The product of its (nonzero) digits is 21600, while the sum is 32.
Adding to 465530022131 its reverse (131220035564), we get a palindrome (596750057695).
The spelling of 465530022131 in words is "four hundred sixty-five billion, five hundred thirty million, twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •