Base | Representation |
---|---|
bin | 101100011101011011010… |
… | …000010010010110000000 |
3 | 101211002010211001110121110 |
4 | 230131123100102112000 |
5 | 400024124200243202 |
6 | 10255321433323320 |
7 | 433510003554012 |
oct | 54353320222600 |
9 | 11732124043543 |
10 | 3055252743552 |
11 | a787a85837a9 |
12 | 414165b66540 |
13 | 1921558c18b9 |
14 | a7c370ba1b2 |
15 | 5471a31726c |
hex | 2c75b412580 |
3055252743552 has 64 divisors (see below), whose sum is σ = 8125400853360. Its totient is φ = 1017177016320.
The previous prime is 3055252743533. The next prime is 3055252743553. The reversal of 3055252743552 is 2553472525503.
It is a tau number, because it is divible by the number of its divisors (64).
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 (3055252743553) 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 7 ways as a sum of consecutive naturals, for example, 4530283 + ... + 5160810.
Almost surely, 23055252743552 is an apocalyptic number.
3055252743552 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
3055252743552 is an abundant number, since it is smaller than the sum of its proper divisors (5070148109808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3055252743552 is an equidigital number, since it uses as much as digits as its factorization.
3055252743552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9691931 (or 9691919 counting only the distinct ones).
The product of its (nonzero) digits is 6300000, while the sum is 48.
The spelling of 3055252743552 in words is "three trillion, fifty-five billion, two hundred fifty-two million, seven hundred forty-three thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •