Base | Representation |
---|---|
bin | 1000011101111001111… |
… | …1101100101000100000 |
3 | 111220110211101200010020 |
4 | 2013132133230220200 |
5 | 4340403443201000 |
6 | 150454305433440 |
7 | 13336542106044 |
oct | 2073637545040 |
9 | 456424350106 |
10 | 145466772000 |
11 | 56768222930 |
12 | 2423863b880 |
13 | 10943340624 |
14 | 707d6b6024 |
15 | 3bb5b2aba0 |
hex | 21de7eca20 |
145466772000 has 192 divisors, whose sum is σ = 519872266368. Its totient is φ = 35264640000.
The previous prime is 145466771981. The next prime is 145466772019. The reversal of 145466772000 is 277664541.
145466772000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (145466771981) and next prime (145466772019).
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 31 ways as a sum of consecutive naturals, for example, 419011 + ... + 683010.
It is an arithmetic number, because the mean of its divisors is an integer number (2707668054).
Almost surely, 2145466772000 is an apocalyptic number.
145466772000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
145466772000 is an abundant number, since it is smaller than the sum of its proper divisors (374405494368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145466772000 is a wasteful number, since it uses less digits than its factorization.
145466772000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1102060 (or 1102042 counting only the distinct ones).
The product of its (nonzero) digits is 282240, while the sum is 42.
The spelling of 145466772000 in words is "one hundred forty-five billion, four hundred sixty-six million, seven hundred seventy-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •