Base | Representation |
---|---|
bin | 10101111000110101110… |
… | …000101011000011111000 |
3 | 12022210110010201121021001 |
4 | 111320311300223003320 |
5 | 144120434432132321 |
6 | 3110554223054344 |
7 | 213446001225460 |
oct | 25706560530370 |
9 | 5283403647231 |
10 | 1504140505336 |
11 | 52a9a2114327 |
12 | 2036197413b4 |
13 | ababc191371 |
14 | 52b2d516ba0 |
15 | 291d5b25c91 |
hex | 15e35c2b0f8 |
1504140505336 has 32 divisors (see below), whose sum is σ = 3298115399040. Its totient is φ = 629640210528.
The previous prime is 1504140505319. The next prime is 1504140505337. The reversal of 1504140505336 is 6335050414051.
It is a junction number, because it is equal to n+sod(n) for n = 1504140505295 and 1504140505304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1504140505337) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 312319126 + ... + 312323941.
It is an arithmetic number, because the mean of its divisors is an integer number (103066106220).
Almost surely, 21504140505336 is an apocalyptic number.
It is an amenable number.
1504140505336 is an abundant number, since it is smaller than the sum of its proper divisors (1793974893704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1504140505336 is a wasteful number, since it uses less digits than its factorization.
1504140505336 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 624643123 (or 624643119 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 37.
Adding to 1504140505336 its reverse (6335050414051), we get a palindrome (7839190919387).
The spelling of 1504140505336 in words is "one trillion, five hundred four billion, one hundred forty million, five hundred five thousand, three hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •