Base | Representation |
---|---|
bin | 11110110111100111… |
… | …000110010011101111 |
3 | 10011112221122012200221 |
4 | 132313213012103233 |
5 | 1020340141013210 |
6 | 23120545432211 |
7 | 2252240662000 |
oct | 366747062357 |
9 | 104487565627 |
10 | 33145251055 |
11 | 130696a2774 |
12 | 651033b667 |
13 | 3182ba4ab7 |
14 | 18660611a7 |
15 | cded101da |
hex | 7b79c64ef |
33145251055 has 32 divisors (see below), whose sum is σ = 47019600000. Its totient is φ = 22416742656.
The previous prime is 33145251053. The next prime is 33145251059. The reversal of 33145251055 is 55015254133.
It is not a de Polignac number, because 33145251055 - 21 = 33145251053 is a prime.
It is a super-2 number, since 2×331452510552 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 33145251055.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (33145251053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7180 + ... + 257569.
It is an arithmetic number, because the mean of its divisors is an integer number (1469362500).
Almost surely, 233145251055 is an apocalyptic number.
33145251055 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
33145251055 is a deficient number, since it is larger than the sum of its proper divisors (13874348945).
33145251055 is an equidigital number, since it uses as much as digits as its factorization.
33145251055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 264848 (or 264834 counting only the distinct ones).
The product of its (nonzero) digits is 45000, while the sum is 34.
The spelling of 33145251055 in words is "thirty-three billion, one hundred forty-five million, two hundred fifty-one thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •