Base | Representation |
---|---|
bin | 10001010010101… |
… | …01110110001000 |
3 | 101002221120012120 |
4 | 20221111312020 |
5 | 244113230422 |
6 | 22221011240 |
7 | 3410643126 |
oct | 1051256610 |
9 | 332846176 |
10 | 145055112 |
11 | 74975064 |
12 | 406b3b20 |
13 | 2408a237 |
14 | 1539c916 |
15 | cb0445c |
hex | 8a55d88 |
145055112 has 32 divisors (see below), whose sum is σ = 378406080. Its totient is φ = 46249280.
The previous prime is 145055111. The next prime is 145055153. The reversal of 145055112 is 211550541.
145055112 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×1450551123 (a number of 25 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is not an unprimeable number, because it can be changed into a prime (145055111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 130839 + ... + 131942.
It is an arithmetic number, because the mean of its divisors is an integer number (11825190).
Almost surely, 2145055112 is an apocalyptic number.
145055112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
145055112 is an abundant number, since it is smaller than the sum of its proper divisors (233350968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145055112 is a wasteful number, since it uses less digits than its factorization.
145055112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 262813 (or 262809 counting only the distinct ones).
The product of its (nonzero) digits is 1000, while the sum is 24.
The square root of 145055112 is about 12043.8827626310. The cubic root of 145055112 is about 525.4253387573.
The spelling of 145055112 in words is "one hundred forty-five million, fifty-five thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •