Base | Representation |
---|---|
bin | 1000011100010100010… |
… | …0000111111001000111 |
3 | 111212101002120011022022 |
4 | 2013011010013321013 |
5 | 4334020232110343 |
6 | 150344104553355 |
7 | 13323141422645 |
oct | 2070504077107 |
9 | 455332504268 |
10 | 145040113223 |
11 | 565693a9875 |
12 | 2413978285b |
13 | 108a5b26b05 |
14 | 703cb72195 |
15 | 3b8d44d568 |
hex | 21c5107e47 |
145040113223 has 2 divisors, whose sum is σ = 145040113224. Its totient is φ = 145040113222.
The previous prime is 145040113181. The next prime is 145040113237. The reversal of 145040113223 is 322311040541.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 145040113223 - 222 = 145035918919 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 145040113192 and 145040113201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145040115223) 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 as a sum of consecutive naturals, namely, 72520056611 + 72520056612.
It is an arithmetic number, because the mean of its divisors is an integer number (72520056612).
Almost surely, 2145040113223 is an apocalyptic number.
145040113223 is a deficient number, since it is larger than the sum of its proper divisors (1).
145040113223 is an equidigital number, since it uses as much as digits as its factorization.
145040113223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 145040113223 its reverse (322311040541), we get a palindrome (467351153764).
The spelling of 145040113223 in words is "one hundred forty-five billion, forty million, one hundred thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •