Base | Representation |
---|---|
bin | 1000011110011101011… |
… | …1100110000000010100 |
3 | 111220212012112002020210 |
4 | 2013213113212000110 |
5 | 4341210101031034 |
6 | 150521144325420 |
7 | 13343330353203 |
oct | 2074727460024 |
9 | 456765462223 |
10 | 145615642644 |
11 | 5683426361a |
12 | 2427a473870 |
13 | 10968135474 |
14 | 709538923a |
15 | 3bc3c358e9 |
hex | 21e75e6014 |
145615642644 has 24 divisors (see below), whose sum is σ = 339801420448. Its totient is φ = 48534035040.
The previous prime is 145615642607. The next prime is 145615642709. The reversal of 145615642644 is 446246516541.
It is a super-2 number, since 2×1456156426442 (a number of 23 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (48) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 145615642593 and 145615642602.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 428302 + ... + 688965.
Almost surely, 2145615642644 is an apocalyptic number.
It is an amenable number.
145615642644 is an abundant number, since it is smaller than the sum of its proper divisors (194185777804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145615642644 is a wasteful number, since it uses less digits than its factorization.
145615642644 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1128135 (or 1128133 counting only the distinct ones).
The product of its digits is 2764800, while the sum is 48.
The spelling of 145615642644 in words is "one hundred forty-five billion, six hundred fifteen million, six hundred forty-two thousand, six hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •