Base | Representation |
---|---|
bin | 1000011101111111011… |
… | …0011111010011110100 |
3 | 111220112102012120221021 |
4 | 2013133312133103310 |
5 | 4340430304231311 |
6 | 150500441230524 |
7 | 13340236356220 |
oct | 2073766372364 |
9 | 456472176837 |
10 | 145489523956 |
11 | 5677a0527a7 |
12 | 24244192444 |
13 | 10947c7851a |
14 | 7082719780 |
15 | 3bb7b22171 |
hex | 21dfd9f4f4 |
145489523956 has 12 divisors (see below), whose sum is σ = 290979047968. Its totient is φ = 62352653112.
The previous prime is 145489523941. The next prime is 145489523969. The reversal of 145489523956 is 659325984541.
It is a happy number.
145489523956 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 145489523894 and 145489523903.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2598027186 + ... + 2598027241.
Almost surely, 2145489523956 is an apocalyptic number.
It is an amenable number.
145489523956 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.
145489523956 is a wasteful number, since it uses less digits than its factorization.
145489523956 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5196054438 (or 5196054436 counting only the distinct ones).
The product of its digits is 46656000, while the sum is 61.
The spelling of 145489523956 in words is "one hundred forty-five billion, four hundred eighty-nine million, five hundred twenty-three thousand, nine hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •