Base | Representation |
---|---|
bin | 10001010010111… |
… | …11110000001100 |
3 | 101010000121212112 |
4 | 20221133300030 |
5 | 244121030232 |
6 | 22221523152 |
7 | 3411202340 |
oct | 1051376014 |
9 | 333017775 |
10 | 145095692 |
11 | 749a25a5 |
12 | 407134b8 |
13 | 240a2851 |
14 | 153ad620 |
15 | cb114b2 |
hex | 8a5fc0c |
145095692 has 12 divisors (see below), whose sum is σ = 290191440. Its totient is φ = 62183856.
The previous prime is 145095683. The next prime is 145095701. The reversal of 145095692 is 296590541.
It is an interprime number because it is at equal distance from previous prime (145095683) and next prime (145095701).
145095692 is an admirable number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2590967 + ... + 2591022.
It is an arithmetic number, because the mean of its divisors is an integer number (24182620).
Almost surely, 2145095692 is an apocalyptic number.
It is an amenable number.
145095692 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145095692 is a wasteful number, since it uses less digits than its factorization.
145095692 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5182000 (or 5181998 counting only the distinct ones).
The product of its (nonzero) digits is 97200, while the sum is 41.
The square root of 145095692 is about 12045.5673174824. The cubic root of 145095692 is about 525.4743311069.
The spelling of 145095692 in words is "one hundred forty-five million, ninety-five thousand, six hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •