Base | Representation |
---|---|
bin | 10100010110001100011… |
… | …110010011101110000100 |
3 | 11221200001102201122211100 |
4 | 110112030132103232010 |
5 | 140402024102022112 |
6 | 2550200043140100 |
7 | 203006136323016 |
oct | 24261436235604 |
9 | 4850042648740 |
10 | 1398221126532 |
11 | 499a8941332a |
12 | 1a6b99514630 |
13 | a1b0c202c19 |
14 | 4b9622721b6 |
15 | 26586dcb2dc |
hex | 1458c793b84 |
1398221126532 has 72 divisors (see below), whose sum is σ = 3613845074112. Its totient is φ = 455687928000.
The previous prime is 1398221126531. The next prime is 1398221126551. The reversal of 1398221126532 is 2356211228931.
1398221126532 is a `hidden beast` number, since 1 + 3 + 9 + 82 + 2 + 11 + 26 + 532 = 666.
It is not an unprimeable number, because it can be changed into a prime (1398221126531) 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 23 ways as a sum of consecutive naturals, for example, 1539594 + ... + 2273057.
It is an arithmetic number, because the mean of its divisors is an integer number (50192292696).
Almost surely, 21398221126532 is an apocalyptic number.
1398221126532 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1398221126532 is an abundant number, since it is smaller than the sum of its proper divisors (2215623947580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1398221126532 is a wasteful number, since it uses less digits than its factorization.
1398221126532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3812889 (or 3812884 counting only the distinct ones).
The product of its digits is 311040, while the sum is 45.
The spelling of 1398221126532 in words is "one trillion, three hundred ninety-eight billion, two hundred twenty-one million, one hundred twenty-six thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •