Base | Representation |
---|---|
bin | 100111100000011… |
… | …0001011001110111 |
3 | 10102101100120200001 |
4 | 1033000301121313 |
5 | 10203323234143 |
6 | 335312132131 |
7 | 44564302045 |
oct | 11700613167 |
9 | 3371316601 |
10 | 1325602423 |
11 | 6202a47a2 |
12 | 30bb37047 |
13 | 181830442 |
14 | c80a7395 |
15 | 7b59b14d |
hex | 4f031677 |
1325602423 has 4 divisors (see below), whose sum is σ = 1326816328. Its totient is φ = 1324388520.
The previous prime is 1325602391. The next prime is 1325602427. The reversal of 1325602423 is 3242065231.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3242065231 = 12157 ⋅266683.
It is a cyclic number.
It is not a de Polignac number, because 1325602423 - 25 = 1325602391 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1325602391 and 1325602400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1325602427) 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, 605313 + ... + 607498.
It is an arithmetic number, because the mean of its divisors is an integer number (331704082).
Almost surely, 21325602423 is an apocalyptic number.
1325602423 is a deficient number, since it is larger than the sum of its proper divisors (1213905).
1325602423 is a wasteful number, since it uses less digits than its factorization.
1325602423 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1213904.
The product of its (nonzero) digits is 8640, while the sum is 28.
The square root of 1325602423 is about 36408.8234223519. The cubic root of 1325602423 is about 1098.5110496666.
Adding to 1325602423 its reverse (3242065231), we get a palindrome (4567667654).
The spelling of 1325602423 in words is "one billion, three hundred twenty-five million, six hundred two thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •