Base | Representation |
---|---|
bin | 10100100000001001111… |
… | …001010100100001000000 |
3 | 11222200122201200200002000 |
4 | 110200021321110201000 |
5 | 141040424303404042 |
6 | 2555125144224000 |
7 | 203535143255433 |
oct | 24401171244100 |
9 | 4880581620060 |
10 | 1408915294272 |
11 | 4a3576a53892 |
12 | 1a9082a6b000 |
13 | a2b24969c25 |
14 | 4c29869181a |
15 | 269b0ba874c |
hex | 14809e54840 |
1408915294272 has 112 divisors (see below), whose sum is σ = 4142712974400. Its totient is φ = 469551928320.
The previous prime is 1408915294253. The next prime is 1408915294289. The reversal of 1408915294272 is 2724925198041.
1408915294272 is a `hidden beast` number, since 1 + 4 + 0 + 8 + 9 + 1 + 529 + 42 + 72 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9675379 + ... + 9819917.
It is an arithmetic number, because the mean of its divisors is an integer number (36988508700).
Almost surely, 21408915294272 is an apocalyptic number.
1408915294272 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1408915294272 is an abundant number, since it is smaller than the sum of its proper divisors (2733797680128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1408915294272 is a wasteful number, since it uses less digits than its factorization.
1408915294272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150201 (or 150185 counting only the distinct ones).
The product of its (nonzero) digits is 2903040, while the sum is 54.
The spelling of 1408915294272 in words is "one trillion, four hundred eight billion, nine hundred fifteen million, two hundred ninety-four thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •