Base | Representation |
---|---|
bin | 1000011101101010010… |
… | …1110001100001100100 |
3 | 111220022021010010010001 |
4 | 2013122211301201210 |
5 | 4340240210143121 |
6 | 150444005311044 |
7 | 13335115166311 |
oct | 2073245614144 |
9 | 456267103101 |
10 | 145401256036 |
11 | 56734244803 |
12 | 2421a705484 |
13 | 109328b1a9a |
14 | 7074addd08 |
15 | 3baeed8991 |
hex | 21da971864 |
145401256036 has 12 divisors (see below), whose sum is σ = 254455729920. Its totient is φ = 72699618920.
The previous prime is 145401255949. The next prime is 145401256057. The reversal of 145401256036 is 630652104541.
It is a super-2 number, since 2×1454012560362 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 145401255986 and 145401256004.
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 3 ways as a sum of consecutive naturals, for example, 139545 + ... + 557023.
It is an arithmetic number, because the mean of its divisors is an integer number (21204644160).
Almost surely, 2145401256036 is an apocalyptic number.
It is an amenable number.
145401256036 is a deficient number, since it is larger than the sum of its proper divisors (109054473884).
145401256036 is a wasteful number, since it uses less digits than its factorization.
145401256036 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 504554 (or 504552 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 37.
The spelling of 145401256036 in words is "one hundred forty-five billion, four hundred one million, two hundred fifty-six thousand, thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •