Base | Representation |
---|---|
bin | 10001010011001… |
… | …10111111100111 |
3 | 101010002010120000 |
4 | 20221212333213 |
5 | 244123002401 |
6 | 22222312343 |
7 | 3411354660 |
oct | 1051467747 |
9 | 333063500 |
10 | 145125351 |
11 | 74a12908 |
12 | 407286b3 |
13 | 240b31b7 |
14 | 153ba367 |
15 | cb1a186 |
hex | 8a66fe7 |
145125351 has 40 divisors (see below), whose sum is σ = 248861184. Its totient is φ = 82561680.
The previous prime is 145125329. The next prime is 145125373. The reversal of 145125351 is 153521541.
It is an interprime number because it is at equal distance from previous prime (145125329) and next prime (145125373).
It is not a de Polignac number, because 145125351 - 25 = 145125319 is a prime.
It is a super-2 number, since 2×1451253512 = 42122735005746402, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145125151) 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 39 ways as a sum of consecutive naturals, for example, 175926 + ... + 176748.
Almost surely, 2145125351 is an apocalyptic number.
145125351 is a deficient number, since it is larger than the sum of its proper divisors (103735833).
145125351 is an equidigital number, since it uses as much as digits as its factorization.
145125351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1153 (or 1144 counting only the distinct ones).
The product of its digits is 3000, while the sum is 27.
The square root of 145125351 is about 12046.7983713516. The cubic root of 145125351 is about 525.5101327244.
Adding to 145125351 its reverse (153521541), we get a palindrome (298646892).
The spelling of 145125351 in words is "one hundred forty-five million, one hundred twenty-five thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •