Base | Representation |
---|---|
bin | 100101001010010110111… |
… | …100010000011100101001 |
3 | 100001010122201220102000221 |
4 | 211022112330100130221 |
5 | 313320031143432413 |
6 | 5233101234130041 |
7 | 352334062636354 |
oct | 45122674203451 |
9 | 10033581812027 |
10 | 2553742952233 |
11 | 8a5044358790 |
12 | 352b23420921 |
13 | 156a80a33ca5 |
14 | 8b85d56529b |
15 | 46666da368d |
hex | 25296f10729 |
2553742952233 has 8 divisors (see below), whose sum is σ = 2907027550656. Its totient is φ = 2220646045200.
The previous prime is 2553742952227. The next prime is 2553742952249. The reversal of 2553742952233 is 3322592473552.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2553742952233 - 237 = 2416303998761 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2553742952213) 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 7 ways as a sum of consecutive naturals, for example, 5046922578 + ... + 5046923083.
It is an arithmetic number, because the mean of its divisors is an integer number (363378443832).
Almost surely, 22553742952233 is an apocalyptic number.
2553742952233 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
2553742952233 is a deficient number, since it is larger than the sum of its proper divisors (353284598423).
2553742952233 is a wasteful number, since it uses less digits than its factorization.
2553742952233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10093845695.
The product of its digits is 13608000, while the sum is 52.
The spelling of 2553742952233 in words is "two trillion, five hundred fifty-three billion, seven hundred forty-two million, nine hundred fifty-two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •