Base | Representation |
---|---|
bin | 1100000010100110… |
… | …1011000111111101 |
3 | 22100020212020021202 |
4 | 3000221223013331 |
5 | 23104412300023 |
6 | 1252420105245 |
7 | 143044551611 |
oct | 30051530775 |
9 | 8306766252 |
10 | 3232150013 |
11 | 1409512164 |
12 | 762535225 |
13 | 3c6817301 |
14 | 229397341 |
15 | 13db4e128 |
hex | c0a6b1fd |
3232150013 has 2 divisors, whose sum is σ = 3232150014. Its totient is φ = 3232150012.
The previous prime is 3232150001. The next prime is 3232150027. The reversal of 3232150013 is 3100512323.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2830027204 + 402122809 = 53198^2 + 20053^2 .
It is a cyclic number.
It is not a de Polignac number, because 3232150013 - 28 = 3232149757 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3232150093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1616075006 + 1616075007.
It is an arithmetic number, because the mean of its divisors is an integer number (1616075007).
Almost surely, 23232150013 is an apocalyptic number.
It is an amenable number.
3232150013 is a deficient number, since it is larger than the sum of its proper divisors (1).
3232150013 is an equidigital number, since it uses as much as digits as its factorization.
3232150013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 540, while the sum is 20.
The square root of 3232150013 is about 56852.0009586294. Note that the first 3 decimals coincide. The cubic root of 3232150013 is about 1478.5312329346.
Adding to 3232150013 its reverse (3100512323), we get a palindrome (6332662336).
The spelling of 3232150013 in words is "three billion, two hundred thirty-two million, one hundred fifty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •