Base | Representation |
---|---|
bin | 11011101110011… |
… | …000010110111111 |
3 | 1012102020201120002 |
4 | 123232120112333 |
5 | 1423034040411 |
6 | 114053344515 |
7 | 14345436500 |
oct | 3356302677 |
9 | 1172221502 |
10 | 465143231 |
11 | 219619aa3 |
12 | 10b93813b |
13 | 7549c5a7 |
14 | 45ac0ba7 |
15 | 2ac8033b |
hex | 1bb985bf |
465143231 has 24 divisors (see below), whose sum is σ = 553547520. Its totient is φ = 389621232.
The previous prime is 465143219. The next prime is 465143257. The reversal of 465143231 is 132341564.
It is not a de Polignac number, because 465143231 - 26 = 465143167 is a prime.
It is a super-2 number, since 2×4651432312 = 432716450690238722, 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 = 465143194 and 465143203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (465143291) 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 23 ways as a sum of consecutive naturals, for example, 413636 + ... + 414758.
It is an arithmetic number, because the mean of its divisors is an integer number (23064480).
Almost surely, 2465143231 is an apocalyptic number.
465143231 is a deficient number, since it is larger than the sum of its proper divisors (88404289).
465143231 is a wasteful number, since it uses less digits than its factorization.
465143231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1323 (or 1316 counting only the distinct ones).
The product of its digits is 8640, while the sum is 29.
The square root of 465143231 is about 21567.1794864326. The cubic root of 465143231 is about 774.8106265012.
Adding to 465143231 its reverse (132341564), we get a palindrome (597484795).
The spelling of 465143231 in words is "four hundred sixty-five million, one hundred forty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •