Base | Representation |
---|---|
bin | 10011101100101010001… |
… | …000000110010111100000 |
3 | 11210101221012121002021110 |
4 | 103230222020012113200 |
5 | 134134204043331134 |
6 | 2513502313423320 |
7 | 166540000414656 |
oct | 23545210062740 |
9 | 4711835532243 |
10 | 1353621464544 |
11 | 482082034148 |
12 | 19a41110ab40 |
13 | 9a85222119b |
14 | 49730c54dd6 |
15 | 253266bb7e9 |
hex | 13b2a2065e0 |
1353621464544 has 144 divisors (see below), whose sum is σ = 3973229366400. Its totient is φ = 402314582016.
The previous prime is 1353621464543. The next prime is 1353621464609. The reversal of 1353621464544 is 4454641263531.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a junction number, because it is equal to n+sod(n) for n = 1353621464493 and 1353621464502.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1353621464543) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 756804 + ... + 1811075.
It is an arithmetic number, because the mean of its divisors is an integer number (27591870600).
Almost surely, 21353621464544 is an apocalyptic number.
It is an amenable number.
1353621464544 is an abundant number, since it is smaller than the sum of its proper divisors (2619607901856).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1353621464544 is a wasteful number, since it uses less digits than its factorization.
1353621464544 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2567945 (or 2567920 counting only the distinct ones).
The product of its digits is 4147200, while the sum is 48.
The spelling of 1353621464544 in words is "one trillion, three hundred fifty-three billion, six hundred twenty-one million, four hundred sixty-four thousand, five hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •