Base | Representation |
---|---|
bin | 11110010010001011101… |
… | …00110010100110000000 |
3 | 10200110211222002022220221 |
4 | 33021011310302212000 |
5 | 114022023202133011 |
6 | 2114005041512424 |
7 | 135114613154551 |
oct | 17110564624600 |
9 | 3613758068827 |
10 | 1040553552256 |
11 | 371329397a39 |
12 | 1497bb342714 |
13 | 7717bc333ca |
14 | 3851234a328 |
15 | 1c101b43971 |
hex | f245d32980 |
1040553552256 has 32 divisors (see below), whose sum is σ = 2073220380000. Its totient is φ = 520215888384.
The previous prime is 1040553552169. The next prime is 1040553552257. The reversal of 1040553552256 is 6522553550401.
It is a tau number, because it is divible by the number of its divisors (32).
It is a super-2 number, since 2×10405535522562 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1040553552257) 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 3 ways as a sum of consecutive naturals, for example, 632370 + ... + 1575118.
It is an arithmetic number, because the mean of its divisors is an integer number (64788136875).
Almost surely, 21040553552256 is an apocalyptic number.
1040553552256 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
1040553552256 is a deficient number, since it is larger than the sum of its proper divisors (1032666827744).
1040553552256 is an frugal number, since it uses more digits than its factorization.
1040553552256 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 951386 (or 951374 counting only the distinct ones).
The product of its (nonzero) digits is 900000, while the sum is 43.
The spelling of 1040553552256 in words is "one trillion, forty billion, five hundred fifty-three million, five hundred fifty-two thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •