Base | Representation |
---|---|
bin | 10011000101001… |
… | …000101001100101 |
3 | 211022100102211102 |
4 | 103011020221211 |
5 | 1123422111003 |
6 | 51433045445 |
7 | 10634626535 |
oct | 2305105145 |
9 | 738312742 |
10 | 320113253 |
11 | 154771909 |
12 | 8b256885 |
13 | 51420935 |
14 | 3072b4c5 |
15 | 1d183588 |
hex | 13148a65 |
320113253 has 4 divisors (see below), whose sum is σ = 320668620. Its totient is φ = 319557888.
The previous prime is 320113243. The next prime is 320113309. The reversal of 320113253 is 352311023.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 352311023 = 1877 ⋅187699.
It can be written as a sum of positive squares in 2 ways, for example, as 314814049 + 5299204 = 17743^2 + 2302^2 .
It is a cyclic number.
It is not a de Polignac number, because 320113253 - 24 = 320113237 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (320113243) 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, 276818 + ... + 277971.
It is an arithmetic number, because the mean of its divisors is an integer number (80167155).
Almost surely, 2320113253 is an apocalyptic number.
It is an amenable number.
320113253 is a deficient number, since it is larger than the sum of its proper divisors (555367).
320113253 is an equidigital number, since it uses as much as digits as its factorization.
320113253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 555366.
The product of its (nonzero) digits is 540, while the sum is 20.
The square root of 320113253 is about 17891.7090575495. The cubic root of 320113253 is about 684.0710607807.
Adding to 320113253 its reverse (352311023), we get a palindrome (672424276).
The spelling of 320113253 in words is "three hundred twenty million, one hundred thirteen thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •