Base | Representation |
---|---|
bin | 100001110101100001011… |
… | …011110111000000111001 |
3 | 22020021210000121012021120 |
4 | 201311201123313000321 |
5 | 301044013233002223 |
6 | 4540104310455453 |
7 | 326663630616456 |
oct | 41654133670071 |
9 | 8207700535246 |
10 | 2325212000313 |
11 | 817131613084 |
12 | 316784964589 |
13 | 13b3607c5957 |
14 | 807801a282d |
15 | 4073dc88be3 |
hex | 21d616f7039 |
2325212000313 has 32 divisors (see below), whose sum is σ = 3290065827840. Its totient is φ = 1455664220160.
The previous prime is 2325212000311. The next prime is 2325212000329. The reversal of 2325212000313 is 3130002125232.
It is a happy number.
2325212000313 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2325212000313 - 21 = 2325212000311 is a prime.
It is a super-2 number, since 2×23252120003132 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2325212000311) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 61240131 + ... + 61278087.
It is an arithmetic number, because the mean of its divisors is an integer number (102814557120).
Almost surely, 22325212000313 is an apocalyptic number.
It is an amenable number.
2325212000313 is a deficient number, since it is larger than the sum of its proper divisors (964853827527).
2325212000313 is a wasteful number, since it uses less digits than its factorization.
2325212000313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40657.
The product of its (nonzero) digits is 2160, while the sum is 24.
Adding to 2325212000313 its reverse (3130002125232), we get a palindrome (5455214125545).
The spelling of 2325212000313 in words is "two trillion, three hundred twenty-five billion, two hundred twelve million, three hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •