Base | Representation |
---|---|
bin | 100001110101110100110… |
… | …000101101111000001101 |
3 | 22020022121121201000200110 |
4 | 201311310300231320031 |
5 | 301100144234010041 |
6 | 4540200412150233 |
7 | 330004645563246 |
oct | 41656460557015 |
9 | 8208547630613 |
10 | 2325536235021 |
11 | 81728863a44a |
12 | 316855468379 |
13 | 13b3b2a2a4cc |
14 | 807b1283ccd |
15 | 4075c483516 |
hex | 21d74c2de0d |
2325536235021 has 4 divisors (see below), whose sum is σ = 3100714980032. Its totient is φ = 1550357490012.
The previous prime is 2325536235019. The next prime is 2325536235067. The reversal of 2325536235021 is 1205326355232.
2325536235021 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 2325536235021 - 21 = 2325536235019 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2325536231021) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 387589372501 + ... + 387589372506.
It is an arithmetic number, because the mean of its divisors is an integer number (775178745008).
Almost surely, 22325536235021 is an apocalyptic number.
It is an amenable number.
2325536235021 is a deficient number, since it is larger than the sum of its proper divisors (775178745011).
2325536235021 is an equidigital number, since it uses as much as digits as its factorization.
2325536235021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 775178745010.
The product of its (nonzero) digits is 324000, while the sum is 39.
The spelling of 2325536235021 in words is "two trillion, three hundred twenty-five billion, five hundred thirty-six million, two hundred thirty-five thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •