Base | Representation |
---|---|
bin | 10001010100010… |
… | …00001010101110 |
3 | 101010100000221120 |
4 | 20222020022232 |
5 | 244141324410 |
6 | 22225241410 |
7 | 3412462062 |
oct | 1052101256 |
9 | 333300846 |
10 | 145261230 |
11 | 74aa5a04 |
12 | 40793266 |
13 | 2412ccba |
14 | 15413aa2 |
15 | cb45570 |
hex | 8a882ae |
145261230 has 64 divisors (see below), whose sum is σ = 355332096. Its totient is φ = 38000000.
The previous prime is 145261219. The next prime is 145261231. The reversal of 145261230 is 32162541.
It is a super-2 number, since 2×1452612302 = 42201649882225800, which contains 22 as substring.
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 145261230.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145261231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 578605 + ... + 578855.
It is an arithmetic number, because the mean of its divisors is an integer number (5552064).
Almost surely, 2145261230 is an apocalyptic number.
145261230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
145261230 is an abundant number, since it is smaller than the sum of its proper divisors (210070866).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145261230 is a wasteful number, since it uses less digits than its factorization.
145261230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 553.
The product of its (nonzero) digits is 1440, while the sum is 24.
The square root of 145261230 is about 12052.4366830944. The cubic root of 145261230 is about 525.6740910243.
The spelling of 145261230 in words is "one hundred forty-five million, two hundred sixty-one thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •