Base | Representation |
---|---|
bin | 10001010101010… |
… | …10100100001101 |
3 | 101010121012012220 |
4 | 20222222210031 |
5 | 244210332000 |
6 | 22232245553 |
7 | 3413616621 |
oct | 1052524415 |
9 | 333535186 |
10 | 145402125 |
11 | 75091850 |
12 | 408408b9 |
13 | 2417c17b |
14 | 1544d181 |
15 | cb721a0 |
hex | 8aaa90d |
145402125 has 64 divisors (see below), whose sum is σ = 267321600. Its totient is φ = 69600000.
The previous prime is 145402123. The next prime is 145402133. The reversal of 145402125 is 521204541.
It is not a de Polignac number, because 145402125 - 21 = 145402123 is a prime.
It is a super-2 number, since 2×1454021252 = 42283555909031250, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 145402095 and 145402104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145402123) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 416451 + ... + 416799.
It is an arithmetic number, because the mean of its divisors is an integer number (4176900).
Almost surely, 2145402125 is an apocalyptic number.
145402125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
145402125 is a deficient number, since it is larger than the sum of its proper divisors (121919475).
145402125 is a wasteful number, since it uses less digits than its factorization.
145402125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 479 (or 469 counting only the distinct ones).
The product of its (nonzero) digits is 1600, while the sum is 24.
The square root of 145402125 is about 12058.2803500333. The cubic root of 145402125 is about 525.8439939359.
Adding to 145402125 its reverse (521204541), we get a palindrome (666606666).
The spelling of 145402125 in words is "one hundred forty-five million, four hundred two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •