Base | Representation |
---|---|
bin | 1000011100111011011… |
… | …1110101000010101000 |
3 | 111212210120012010101202 |
4 | 2013032313311002220 |
5 | 4334334343144230 |
6 | 150412303503332 |
7 | 13330210160165 |
oct | 2071667650250 |
9 | 455716163352 |
10 | 145204662440 |
11 | 56643279062 |
12 | 241848b7b48 |
13 | 10900c4b106 |
14 | 705696706c |
15 | 3b9cb03a45 |
hex | 21cedf50a8 |
145204662440 has 64 divisors (see below), whose sum is σ = 330931863360. Its totient is φ = 57335247360.
The previous prime is 145204662437. The next prime is 145204662479. The reversal of 145204662440 is 44266402541.
145204662440 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 145204662394 and 145204662403.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1151300 + ... + 1271180.
It is an arithmetic number, because the mean of its divisors is an integer number (5170810365).
Almost surely, 2145204662440 is an apocalyptic number.
145204662440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
145204662440 is an abundant number, since it is smaller than the sum of its proper divisors (185727200920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145204662440 is a wasteful number, since it uses less digits than its factorization.
145204662440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120282 (or 120278 counting only the distinct ones).
The product of its (nonzero) digits is 184320, while the sum is 38.
The spelling of 145204662440 in words is "one hundred forty-five billion, two hundred four million, six hundred sixty-two thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •