Base | Representation |
---|---|
bin | 100001110101010111101… |
… | …100000000001011110111 |
3 | 22020021100121212111011210 |
4 | 201311113230000023313 |
5 | 301043144401210043 |
6 | 4540040145332503 |
7 | 326656603553562 |
oct | 41652754001367 |
9 | 8207317774153 |
10 | 2325048460023 |
11 | 817058272913 |
12 | 31673a037133 |
13 | 13b335965953 |
14 | 807665914d9 |
15 | 4072e732633 |
hex | 21d57b002f7 |
2325048460023 has 4 divisors (see below), whose sum is σ = 3100064613368. Its totient is φ = 1550032306680.
The previous prime is 2325048460019. The next prime is 2325048460061. The reversal of 2325048460023 is 3200648405232.
2325048460023 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.
It is not a de Polignac number, because 2325048460023 - 22 = 2325048460019 is a prime.
It is a super-3 number, since 3×23250484600233 (a number of 38 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2325048468023) 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, 387508076668 + ... + 387508076673.
It is an arithmetic number, because the mean of its divisors is an integer number (775016153342).
Almost surely, 22325048460023 is an apocalyptic number.
2325048460023 is a deficient number, since it is larger than the sum of its proper divisors (775016153345).
2325048460023 is an equidigital number, since it uses as much as digits as its factorization.
2325048460023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 775016153344.
The product of its (nonzero) digits is 276480, while the sum is 39.
The spelling of 2325048460023 in words is "two trillion, three hundred twenty-five billion, forty-eight million, four hundred sixty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •