Base | Representation |
---|---|
bin | 101001000111001010000… |
… | …011000101100010101001 |
3 | 101000002021212211210211220 |
4 | 221013022003011202221 |
5 | 332241433412221413 |
6 | 10001512111212253 |
7 | 411053450665551 |
oct | 51071203054251 |
9 | 11002255753756 |
10 | 2825183320233 |
11 | 99a17637182a |
12 | 397658217089 |
13 | 17654ba11461 |
14 | 9aa4d67c161 |
15 | 4d752104223 |
hex | 291ca0c58a9 |
2825183320233 has 8 divisors (see below), whose sum is σ = 3767298157248. Its totient is φ = 1883262015024.
The previous prime is 2825183320217. The next prime is 2825183320243. The reversal of 2825183320233 is 3320233815282.
2825183320233 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2825183320233 - 24 = 2825183320217 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2825183320213) 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, 48348885 + ... + 48407282.
It is an arithmetic number, because the mean of its divisors is an integer number (470912269656).
Almost surely, 22825183320233 is an apocalyptic number.
It is an amenable number.
2825183320233 is a deficient number, since it is larger than the sum of its proper divisors (942114837015).
2825183320233 is an equidigital number, since it uses as much as digits as its factorization.
2825183320233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96765903.
The product of its (nonzero) digits is 414720, while the sum is 42.
The spelling of 2825183320233 in words is "two trillion, eight hundred twenty-five billion, one hundred eighty-three million, three hundred twenty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •