Base | Representation |
---|---|
bin | 10101010011110101001… |
… | …111101010100011101100 |
3 | 12011222212210100202100111 |
4 | 111103311033222203230 |
5 | 142443044232430121 |
6 | 3040423155105404 |
7 | 210541165364215 |
oct | 25236517524354 |
9 | 5158783322314 |
10 | 1464403405036 |
11 | 5150605aa770 |
12 | 1b79898a2264 |
13 | a8128719b70 |
14 | 50c3dc2240c |
15 | 2815c2702e1 |
hex | 154f53ea8ec |
1464403405036 has 48 divisors (see below), whose sum is σ = 3010891514400. Its totient is φ = 614402334720.
The previous prime is 1464403405021. The next prime is 1464403405043. The reversal of 1464403405036 is 6305043044641.
It is a super-2 number, since 2×14644034050362 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1464403405036.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12841260 + ... + 12954796.
It is an arithmetic number, because the mean of its divisors is an integer number (62726906550).
Almost surely, 21464403405036 is an apocalyptic number.
It is an amenable number.
1464403405036 is an abundant number, since it is smaller than the sum of its proper divisors (1546488109364).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1464403405036 is a wasteful number, since it uses less digits than its factorization.
1464403405036 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136114 (or 136112 counting only the distinct ones).
The product of its (nonzero) digits is 414720, while the sum is 40.
Adding to 1464403405036 its reverse (6305043044641), we get a palindrome (7769446449677).
The spelling of 1464403405036 in words is "one trillion, four hundred sixty-four billion, four hundred three million, four hundred five thousand, thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •