Base | Representation |
---|---|
bin | 100100110101011011001111… |
… | …1011000110111001001000101 |
3 | 1120111012022002222000201100012 |
4 | 1021222312133120313021011 |
5 | 314431422321213044023 |
6 | 3105032304154200005 |
7 | 125150244424322606 |
oct | 11152663730671105 |
9 | 1514168088021305 |
10 | 324002122003013 |
11 | 9426758a175423 |
12 | 30409947123005 |
13 | 10ba336600715c |
14 | 5a01b01b69dad |
15 | 276d08ab11978 |
hex | 126ad9f637245 |
324002122003013 has 16 divisors (see below), whose sum is σ = 325900673610624. Its totient is φ = 322107055656960.
The previous prime is 324002122002961. The next prime is 324002122003033. The reversal of 324002122003013 is 310300221200423.
It is a cyclic number.
It is not a de Polignac number, because 324002122003013 - 212 = 324002121998917 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 324002122003013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (324002122003033) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2458649381 + ... + 2458781157.
It is an arithmetic number, because the mean of its divisors is an integer number (20368792100664).
Almost surely, 2324002122003013 is an apocalyptic number.
It is an amenable number.
324002122003013 is a deficient number, since it is larger than the sum of its proper divisors (1898551607611).
324002122003013 is a wasteful number, since it uses less digits than its factorization.
324002122003013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 144892.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 324002122003013 its reverse (310300221200423), we get a palindrome (634302343203436).
The spelling of 324002122003013 in words is "three hundred twenty-four trillion, two billion, one hundred twenty-two million, three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •