Base | Representation |
---|---|
bin | 1000011101000010000… |
… | …0100101010011111011 |
3 | 111212212110212021101101 |
4 | 2013100200211103323 |
5 | 4334413410420011 |
6 | 150415124232231 |
7 | 13330662451414 |
oct | 2072040452373 |
9 | 455773767341 |
10 | 145232123131 |
11 | 56657824747 |
12 | 24191b3b677 |
13 | 10906844344 |
14 | 705a47480b |
15 | 3ba022a2c1 |
hex | 21d08254fb |
145232123131 has 16 divisors (see below), whose sum is σ = 152960762880. Its totient is φ = 137764634560.
The previous prime is 145232123117. The next prime is 145232123137. The reversal of 145232123131 is 131321232541.
It is a cyclic number.
It is not a de Polignac number, because 145232123131 - 221 = 145230025979 is a prime.
It is a super-2 number, since 2×1452321231312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 145232123131.
It is not an unprimeable number, because it can be changed into a prime (145232123137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 171946 + ... + 565711.
It is an arithmetic number, because the mean of its divisors is an integer number (9560047680).
Almost surely, 2145232123131 is an apocalyptic number.
145232123131 is a deficient number, since it is larger than the sum of its proper divisors (7728639749).
145232123131 is an equidigital number, since it uses as much as digits as its factorization.
145232123131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 737834.
The product of its digits is 4320, while the sum is 28.
Adding to 145232123131 its reverse (131321232541), we get a palindrome (276553355672).
The spelling of 145232123131 in words is "one hundred forty-five billion, two hundred thirty-two million, one hundred twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •