Base | Representation |
---|---|
bin | 1000101010011011… |
… | …0101001010100101 |
3 | 20000001201100011220 |
4 | 2022212311022211 |
5 | 14230302410140 |
6 | 1022430050553 |
7 | 111424605003 |
oct | 21246651245 |
9 | 6001640156 |
10 | 2325435045 |
11 | a9371384a |
12 | 54a949a59 |
13 | 2b0a0c38b |
14 | 180bada73 |
15 | d9247bd0 |
hex | 8a9b52a5 |
2325435045 has 8 divisors (see below), whose sum is σ = 3720696096. Its totient is φ = 1240232016.
The previous prime is 2325435041. The next prime is 2325435053. The reversal of 2325435045 is 5405345232.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2325435045 - 22 = 2325435041 is a prime.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 2325434997 and 2325435015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2325435041) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 77514487 + ... + 77514516.
It is an arithmetic number, because the mean of its divisors is an integer number (465087012).
Almost surely, 22325435045 is an apocalyptic number.
It is an amenable number.
2325435045 is a deficient number, since it is larger than the sum of its proper divisors (1395261051).
2325435045 is a wasteful number, since it uses less digits than its factorization.
2325435045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155029011.
The product of its (nonzero) digits is 72000, while the sum is 33.
The square root of 2325435045 is about 48222.7648004550. The cubic root of 2325435045 is about 1324.8541517405.
The spelling of 2325435045 in words is "two billion, three hundred twenty-five million, four hundred thirty-five thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •