Base | Representation |
---|---|
bin | 1100101110110010111001… |
… | …1000100010111100110000 |
3 | 1211120012111000201022202100 |
4 | 3023230232120202330300 |
5 | 3313321030102313313 |
6 | 45434343322020400 |
7 | 2643220246636464 |
oct | 313545630427460 |
9 | 54505430638670 |
10 | 13998076604208 |
11 | 450760734a994 |
12 | 16a0b07647700 |
13 | 7a702261b428 |
14 | 365720c344a4 |
15 | 1941c711d173 |
hex | cbb2e622f30 |
13998076604208 has 30 divisors (see below), whose sum is σ = 39175172719124. Its totient is φ = 4666025534688.
The previous prime is 13998076604147. The next prime is 13998076604221. The reversal of 13998076604208 is 80240667089931.
13998076604208 is a `hidden beast` number, since 1 + 3 + 9 + 9 + 80 + 76 + 60 + 420 + 8 = 666.
13998076604208 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×139980766042082 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 48604432510 + ... + 48604432797.
Almost surely, 213998076604208 is an apocalyptic number.
13998076604208 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
13998076604208 is an abundant number, since it is smaller than the sum of its proper divisors (25177096114916).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13998076604208 is a wasteful number, since it uses less digits than its factorization.
13998076604208 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 97208865321 (or 97208865312 counting only the distinct ones).
The product of its (nonzero) digits is 31352832, while the sum is 63.
The spelling of 13998076604208 in words is "thirteen trillion, nine hundred ninety-eight billion, seventy-six million, six hundred four thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •