Base | Representation |
---|---|
bin | 10011101101000010100… |
… | …010100010001100011100 |
3 | 11210102222202022001101210 |
4 | 103231002202202030130 |
5 | 134141023422004302 |
6 | 2514011104304420 |
7 | 166553103001146 |
oct | 23550242421434 |
9 | 4712882261353 |
10 | 1354031047452 |
11 | 482272254916 |
12 | 19a506312110 |
13 | 9a8b9039535 |
14 | 4976d3d1c96 |
15 | 2534c62466c |
hex | 13b428a231c |
1354031047452 has 24 divisors (see below), whose sum is σ = 3159427881232. Its totient is φ = 451340524800.
The previous prime is 1354031047441. The next prime is 1354031047463. The reversal of 1354031047452 is 2547401304531.
It is an interprime number because it is at equal distance from previous prime (1354031047441) and next prime (1354031047463).
It is a self number, because there is not a number n which added to its sum of digits gives 1354031047452.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 1948302 + ... + 2550282.
Almost surely, 21354031047452 is an apocalyptic number.
1354031047452 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1354031047452 is an abundant number, since it is smaller than the sum of its proper divisors (1805396833780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1354031047452 is a wasteful number, since it uses less digits than its factorization.
1354031047452 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 789429 (or 789427 counting only the distinct ones).
The product of its (nonzero) digits is 201600, while the sum is 39.
The spelling of 1354031047452 in words is "one trillion, three hundred fifty-four billion, thirty-one million, forty-seven thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •