Base | Representation |
---|---|
bin | 11000000101011000001… |
… | …011001111111101010000 |
3 | 12212012221201001020101110 |
4 | 120011120023033331100 |
5 | 204104011142043122 |
6 | 3304152104333320 |
7 | 230400322532622 |
oct | 30053013177520 |
9 | 5765851036343 |
10 | 1655041752912 |
11 | 588998a17089 |
12 | 228912174240 |
13 | c00ba382cc2 |
14 | 5a16686ac12 |
15 | 2d0b88cb90c |
hex | 181582cff50 |
1655041752912 has 80 divisors (see below), whose sum is σ = 4303348318080. Its totient is φ = 548091388416.
The previous prime is 1655041752911. The next prime is 1655041752971. The reversal of 1655041752912 is 2192571405561.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1655041752911) 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 15 ways as a sum of consecutive naturals, for example, 92405014 + ... + 92422922.
It is an arithmetic number, because the mean of its divisors is an integer number (53791853976).
Almost surely, 21655041752912 is an apocalyptic number.
1655041752912 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1655041752912 is an abundant number, since it is smaller than the sum of its proper divisors (2648306565168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1655041752912 is a wasteful number, since it uses less digits than its factorization.
1655041752912 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30340 (or 30334 counting only the distinct ones).
The product of its (nonzero) digits is 756000, while the sum is 48.
The spelling of 1655041752912 in words is "one trillion, six hundred fifty-five billion, forty-one million, seven hundred fifty-two thousand, nine hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •