Base | Representation |
---|---|
bin | 10001010010101… |
… | …11010111000100 |
3 | 101002221212201100 |
4 | 20221113113010 |
5 | 244113430231 |
6 | 22221100100 |
7 | 3411000201 |
oct | 1051272704 |
9 | 332855640 |
10 | 145061316 |
11 | 74979794 |
12 | 406b7630 |
13 | 2408ccca |
14 | 153a0ca8 |
15 | cb061e6 |
hex | 8a575c4 |
145061316 has 36 divisors (see below), whose sum is σ = 367082352. Its totient is φ = 48301104.
The previous prime is 145061303. The next prime is 145061339. The reversal of 145061316 is 613160541.
145061316 is a `hidden beast` number, since 1 + 45 + 0 + 613 + 1 + 6 = 666.
145061316 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (36).
It is a self number, because there is not a number n which added to its sum of digits gives 145061316.
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 11 ways as a sum of consecutive naturals, for example, 45511 + ... + 48593.
It is an arithmetic number, because the mean of its divisors is an integer number (10196732).
Almost surely, 2145061316 is an apocalyptic number.
It is an amenable number.
145061316 is an abundant number, since it is smaller than the sum of its proper divisors (222021036).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145061316 is a wasteful number, since it uses less digits than its factorization.
145061316 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4400 (or 4395 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The square root of 145061316 is about 12044.1403180136. The cubic root of 145061316 is about 525.4328294559.
The spelling of 145061316 in words is "one hundred forty-five million, sixty-one thousand, three hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •