Base | Representation |
---|---|
bin | 10001010110111… |
… | …11110010011110 |
3 | 101011000021021000 |
4 | 20223133302132 |
5 | 244234321001 |
6 | 22241051130 |
7 | 3415515321 |
oct | 1053376236 |
9 | 334007230 |
10 | 145620126 |
11 | 75220613 |
12 | 40926aa6 |
13 | 24227472 |
14 | 154a87b8 |
15 | cbb6a86 |
hex | 8adfc9e |
145620126 has 16 divisors (see below), whose sum is σ = 323600400. Its totient is φ = 48540024.
The previous prime is 145620091. The next prime is 145620143. The reversal of 145620126 is 621026541.
145620126 is a `hidden beast` number, since 1 + 456 + 201 + 2 + 6 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 145620126.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 1348281 + ... + 1348388.
It is an arithmetic number, because the mean of its divisors is an integer number (20225025).
Almost surely, 2145620126 is an apocalyptic number.
145620126 is an abundant number, since it is smaller than the sum of its proper divisors (177980274).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145620126 is a wasteful number, since it uses less digits than its factorization.
145620126 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2696680 (or 2696674 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
The square root of 145620126 is about 12067.3164373857. The cubic root of 145620126 is about 526.1066615179.
Adding to 145620126 its reverse (621026541), we get a palindrome (766646667).
The spelling of 145620126 in words is "one hundred forty-five million, six hundred twenty thousand, one hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •