Base | Representation |
---|---|
bin | 1001011001101101101… |
… | …01000011010011001101 |
3 | 1010212211101022110010201 |
4 | 10230312311003103031 |
5 | 20243042330032023 |
6 | 404223104133501 |
7 | 32224202204161 |
oct | 4546665032315 |
9 | 1125741273121 |
10 | 323042424013 |
11 | 115002032531 |
12 | 52736307291 |
13 | 24602922a2a |
14 | 118c7514ca1 |
15 | 860a59dbad |
hex | 4b36d434cd |
323042424013 has 2 divisors, whose sum is σ = 323042424014. Its totient is φ = 323042424012.
The previous prime is 323042424011. The next prime is 323042424031. The reversal of 323042424013 is 310424240323.
Together with next prime (323042424031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 322394568804 + 647855209 = 567798^2 + 25453^2 .
It is a cyclic number.
It is not a de Polignac number, because 323042424013 - 21 = 323042424011 is a prime.
Together with 323042424011, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (323042424011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 161521212006 + 161521212007.
It is an arithmetic number, because the mean of its divisors is an integer number (161521212007).
Almost surely, 2323042424013 is an apocalyptic number.
It is an amenable number.
323042424013 is a deficient number, since it is larger than the sum of its proper divisors (1).
323042424013 is an equidigital number, since it uses as much as digits as its factorization.
323042424013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13824, while the sum is 28.
Adding to 323042424013 its reverse (310424240323), we get a palindrome (633466664336).
The spelling of 323042424013 in words is "three hundred twenty-three billion, forty-two million, four hundred twenty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •