Base | Representation |
---|---|
bin | 10110010101111110111… |
… | …000010010100100000100 |
3 | 12102210012220012201221210 |
4 | 112111332320102210010 |
5 | 200124031043304423 |
6 | 3133211232411420 |
7 | 215634302513142 |
oct | 26257670224404 |
9 | 5383186181853 |
10 | 1535432009988 |
11 | 54219a382978 |
12 | 2096b10a6b70 |
13 | b1a37ca86a6 |
14 | 5445b2b0592 |
15 | 29e17d12b93 |
hex | 1657ee12904 |
1535432009988 has 48 divisors (see below), whose sum is σ = 3771353960640. Its totient is φ = 484858166400.
The previous prime is 1535432009987. The next prime is 1535432010011. The reversal of 1535432009988 is 8899002345351.
It is a happy number.
It is a Smith number, since the sum of its digits (57) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is not an unprimeable number, because it can be changed into a prime (1535432009987) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8939398 + ... + 9109538.
It is an arithmetic number, because the mean of its divisors is an integer number (78569874180).
Almost surely, 21535432009988 is an apocalyptic number.
It is an amenable number.
1535432009988 is an abundant number, since it is smaller than the sum of its proper divisors (2235921950652).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1535432009988 is a wasteful number, since it uses less digits than its factorization.
1535432009988 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 209748 (or 209746 counting only the distinct ones).
The product of its (nonzero) digits is 9331200, while the sum is 57.
The spelling of 1535432009988 in words is "one trillion, five hundred thirty-five billion, four hundred thirty-two million, nine thousand, nine hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •