Base | Representation |
---|---|
bin | 1000011101110111000… |
… | …1000111011100100100 |
3 | 111220102222102021212012 |
4 | 2013131301013130210 |
5 | 4340342331423220 |
6 | 150453152013352 |
7 | 13336333240454 |
oct | 2073561073444 |
9 | 456388367765 |
10 | 145454561060 |
11 | 56761342646 |
12 | 24234531258 |
13 | 10940956613 |
14 | 707bc17d64 |
15 | 3bb4a17ac5 |
hex | 21ddc47724 |
145454561060 has 24 divisors (see below), whose sum is σ = 305462472000. Its totient is φ = 58180320864.
The previous prime is 145454561041. The next prime is 145454561071. The reversal of 145454561060 is 60165454541.
145454561060 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 = 145454560999 and 145454561017.
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 7 ways as a sum of consecutive naturals, for example, 1023257 + ... + 1156703.
It is an arithmetic number, because the mean of its divisors is an integer number (12727603000).
Almost surely, 2145454561060 is an apocalyptic number.
145454561060 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
145454561060 is an abundant number, since it is smaller than the sum of its proper divisors (160007910940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145454561060 is a wasteful number, since it uses less digits than its factorization.
145454561060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 187955 (or 187953 counting only the distinct ones).
The product of its (nonzero) digits is 288000, while the sum is 41.
The spelling of 145454561060 in words is "one hundred forty-five billion, four hundred fifty-four million, five hundred sixty-one thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •