Base | Representation |
---|---|
bin | 10011011000001… |
… | …011010101110101 |
3 | 211122202001020102 |
4 | 103120023111311 |
5 | 1131211330023 |
6 | 52132043445 |
7 | 11025230012 |
oct | 2330132565 |
9 | 748661212 |
10 | 325105013 |
11 | 157571232 |
12 | 90a63585 |
13 | 5247aa3c |
14 | 3126a709 |
15 | 1d81c628 |
hex | 1360b575 |
325105013 has 4 divisors (see below), whose sum is σ = 325171308. Its totient is φ = 325038720.
The previous prime is 325105009. The next prime is 325105019. The reversal of 325105013 is 310501523.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 310501523 = 4957 ⋅62639.
It can be written as a sum of positive squares in 2 ways, for example, as 163891204 + 161213809 = 12802^2 + 12697^2 .
It is a cyclic number.
It is not a de Polignac number, because 325105013 - 22 = 325105009 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 (325105019) 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, 25148 + ... + 35813.
It is an arithmetic number, because the mean of its divisors is an integer number (81292827).
Almost surely, 2325105013 is an apocalyptic number.
It is an amenable number.
325105013 is a deficient number, since it is larger than the sum of its proper divisors (66295).
325105013 is an equidigital number, since it uses as much as digits as its factorization.
325105013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66294.
The product of its (nonzero) digits is 450, while the sum is 20.
The square root of 325105013 is about 18030.6686786708. The cubic root of 325105013 is about 687.6084768996.
Adding to 325105013 its reverse (310501523), we get a palindrome (635606536).
The spelling of 325105013 in words is "three hundred twenty-five million, one hundred five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •