Base | Representation |
---|---|
bin | 11001110000111101… |
… | …10000111110001000 |
3 | 1022201000021100021100 |
4 | 30320132300332020 |
5 | 211312104202023 |
6 | 10204330141400 |
7 | 666532142526 |
oct | 147036607610 |
9 | 38630240240 |
10 | 13832490888 |
11 | 5959098157 |
12 | 2820581860 |
13 | 13c59bc568 |
14 | 953151316 |
15 | 55e595c43 |
hex | 3387b0f88 |
13832490888 has 24 divisors (see below), whose sum is σ = 37462996350. Its totient is φ = 4610830272.
The previous prime is 13832490871. The next prime is 13832490901. The reversal of 13832490888 is 88809423831.
It is a happy number.
13832490888 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 10241844804 + 3590646084 = 101202^2 + 59922^2 .
It is a tau number, because it is divible by the number of its divisors (24).
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 5 ways as a sum of consecutive naturals, for example, 96058893 + ... + 96059036.
Almost surely, 213832490888 is an apocalyptic number.
13832490888 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
13832490888 is an abundant number, since it is smaller than the sum of its proper divisors (23630505462).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13832490888 is a wasteful number, since it uses less digits than its factorization.
13832490888 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 192117941 (or 192117934 counting only the distinct ones).
The product of its (nonzero) digits is 2654208, while the sum is 54.
The spelling of 13832490888 in words is "thirteen billion, eight hundred thirty-two million, four hundred ninety thousand, eight hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •