Base | Representation |
---|---|
bin | 111110110001101… |
… | …001001110101011 |
3 | 2201101210011121102 |
4 | 332301221032223 |
5 | 4124104420243 |
6 | 252301432015 |
7 | 35046030536 |
oct | 7661511653 |
9 | 2641704542 |
10 | 1053201323 |
11 | 4a0560819 |
12 | 25486b60b |
13 | 13a276765 |
14 | 9dc39a1d |
15 | 626de9b8 |
hex | 3ec693ab |
1053201323 has 8 divisors (see below), whose sum is σ = 1153608480. Its totient is φ = 957066880.
The previous prime is 1053201299. The next prime is 1053201329. The reversal of 1053201323 is 3231023501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1053201323 - 218 = 1052939179 is a prime.
It is a super-2 number, since 2×10532013232 = 2218466053537900658, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1053201295 and 1053201304.
It is not an unprimeable number, because it can be changed into a prime (1053201329) 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, 1067663 + ... + 1068648.
It is an arithmetic number, because the mean of its divisors is an integer number (144201060).
Almost surely, 21053201323 is an apocalyptic number.
1053201323 is a deficient number, since it is larger than the sum of its proper divisors (100407157).
1053201323 is a wasteful number, since it uses less digits than its factorization.
1053201323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2136357.
The product of its (nonzero) digits is 540, while the sum is 20.
The square root of 1053201323 is about 32453.0633839088. The cubic root of 1053201323 is about 1017.4282653217.
Adding to 1053201323 its reverse (3231023501), we get a palindrome (4284224824).
The spelling of 1053201323 in words is "one billion, fifty-three million, two hundred one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •