Base | Representation |
---|---|
bin | 1000011101101010010… |
… | …1110001100001101000 |
3 | 111220022021010010010012 |
4 | 2013122211301201220 |
5 | 4340240210143130 |
6 | 150444005311052 |
7 | 13335115166315 |
oct | 2073245614150 |
9 | 456267103105 |
10 | 145401256040 |
11 | 56734244807 |
12 | 2421a705488 |
13 | 109328b1aa1 |
14 | 7074addd0c |
15 | 3baeed8995 |
hex | 21da971868 |
145401256040 has 64 divisors (see below), whose sum is σ = 330440722560. Its totient is φ = 57576372480.
The previous prime is 145401255949. The next prime is 145401256057. The reversal of 145401256040 is 40652104541.
It is a super-2 number, since 2×1454012560402 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 145401255988 and 145401256006.
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 15 ways as a sum of consecutive naturals, for example, 22397195 + ... + 22403685.
It is an arithmetic number, because the mean of its divisors is an integer number (5163136290).
Almost surely, 2145401256040 is an apocalyptic number.
145401256040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
145401256040 is an abundant number, since it is smaller than the sum of its proper divisors (185039466520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145401256040 is a wasteful number, since it uses less digits than its factorization.
145401256040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12042 (or 12038 counting only the distinct ones).
The product of its (nonzero) digits is 19200, while the sum is 32.
The spelling of 145401256040 in words is "one hundred forty-five billion, four hundred one million, two hundred fifty-six thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •