Base | Representation |
---|---|
bin | 10001010100101… |
… | …00101011000011 |
3 | 101010102122012122 |
4 | 20222110223003 |
5 | 244144444301 |
6 | 22230314455 |
7 | 3413064314 |
oct | 1052245303 |
9 | 333378178 |
10 | 145312451 |
11 | 75030439 |
12 | 407b8a2b |
13 | 2414a3cb |
14 | 1542860b |
15 | cb5581b |
hex | 8a94ac3 |
145312451 has 2 divisors, whose sum is σ = 145312452. Its totient is φ = 145312450.
The previous prime is 145312439. The next prime is 145312477. The reversal of 145312451 is 154213541.
It is an a-pointer prime, because the next prime (145312477) can be obtained adding 145312451 to its sum of digits (26).
It is a weak prime.
It is an emirp because it is prime and its reverse (154213541) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-145312451 is a prime.
It is a super-2 number, since 2×1453124512 = 42231416831254802, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 145312451.
It is not a weakly prime, because it can be changed into another prime (145312051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72656225 + 72656226.
It is an arithmetic number, because the mean of its divisors is an integer number (72656226).
Almost surely, 2145312451 is an apocalyptic number.
145312451 is a deficient number, since it is larger than the sum of its proper divisors (1).
145312451 is an equidigital number, since it uses as much as digits as its factorization.
145312451 is an evil number, because the sum of its binary digits is even.
The product of its digits is 2400, while the sum is 26.
The square root of 145312451 is about 12054.5614188157. The cubic root of 145312451 is about 525.7358702719.
Adding to 145312451 its reverse (154213541), we get a palindrome (299525992).
The spelling of 145312451 in words is "one hundred forty-five million, three hundred twelve thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •