Base | Representation |
---|---|
bin | 1000011101101010010… |
… | …1010110101101111100 |
3 | 111220022020220112111101 |
4 | 2013122211112231330 |
5 | 4340240143134421 |
6 | 150444003102444 |
7 | 13335114231223 |
oct | 2073245265574 |
9 | 456266815441 |
10 | 145401146236 |
11 | 5673417a265 |
12 | 2421a671a24 |
13 | 10932873b08 |
14 | 7074ab1cba |
15 | 3baeeb6191 |
hex | 21da956b7c |
145401146236 has 48 divisors (see below), whose sum is σ = 264506841088. Its totient is φ = 69861528000.
The previous prime is 145401146207. The next prime is 145401146239. The reversal of 145401146236 is 632641104541.
It is a super-2 number, since 2×1454011462362 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 145401146195 and 145401146204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145401146239) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 29365561 + ... + 29370511.
Almost surely, 2145401146236 is an apocalyptic number.
It is an amenable number.
145401146236 is a deficient number, since it is larger than the sum of its proper divisors (119105694852).
145401146236 is a wasteful number, since it uses less digits than its factorization.
145401146236 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6602 (or 6600 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 37.
The spelling of 145401146236 in words is "one hundred forty-five billion, four hundred one million, one hundred forty-six thousand, two hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •