Base | Representation |
---|---|
bin | 100100110110001110111011… |
… | …0010001010100110110111111 |
3 | 1120111120220120022011201022010 |
4 | 1021230131312101110312333 |
5 | 314440232112413431143 |
6 | 3105155300410022303 |
7 | 125161253540014614 |
oct | 11154356621246677 |
9 | 1514526508151263 |
10 | 324113101311423 |
11 | 942aa65a096426 |
12 | 30427359a17993 |
13 | 10bb0971378098 |
14 | 5a0722d03250b |
15 | 2770dd3b9ea33 |
hex | 126c776454dbf |
324113101311423 has 8 divisors (see below), whose sum is σ = 432191043043200. Its totient is φ = 216055280226968.
The previous prime is 324113101311407. The next prime is 324113101311481.
It is a happy number.
324113101311423 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 324113101311423 - 24 = 324113101311407 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (324113101311023) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5030124243 + ... + 5030188676.
It is an arithmetic number, because the mean of its divisors is an integer number (54023880380400).
Almost surely, 2324113101311423 is an apocalyptic number.
324113101311423 is a deficient number, since it is larger than the sum of its proper divisors (108077941731777).
324113101311423 is a wasteful number, since it uses less digits than its factorization.
324113101311423 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10060323661.
The product of its (nonzero) digits is 5184, while the sum is 30.
It can be divided in two parts, 32411310 and 1311423, that added together give a palindrome (33722733).
The spelling of 324113101311423 in words is "three hundred twenty-four trillion, one hundred thirteen billion, one hundred one million, three hundred eleven thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •