Base | Representation |
---|---|
bin | 100100111000010101111011… |
… | …1010111100000001000000011 |
3 | 1120112121121220221011010012220 |
4 | 1021300223313113200020003 |
5 | 320010004401140001011 |
6 | 3105540410012022123 |
7 | 125221226333140545 |
oct | 11160536727401003 |
9 | 1515547827133186 |
10 | 324403030000131 |
11 | 944016092a1465 |
12 | 30473592461943 |
13 | 10c020c77abba4 |
14 | 5a1729476b695 |
15 | 27787020b6506 |
hex | 1270af75e0203 |
324403030000131 has 8 divisors (see below), whose sum is σ = 444227572612944. Its totient is φ = 210423587027040.
The previous prime is 324403030000111. The next prime is 324403030000139. The reversal of 324403030000131 is 131000030304423.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 324403030000131 - 27 = 324403030000003 is a prime.
It is a super-2 number, since 2×3244030300001312 (a number of 30 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (324403030000139) 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, 1461274909800 + ... + 1461274910021.
It is an arithmetic number, because the mean of its divisors is an integer number (55528446576618).
Almost surely, 2324403030000131 is an apocalyptic number.
324403030000131 is a deficient number, since it is larger than the sum of its proper divisors (119824542612813).
324403030000131 is a wasteful number, since it uses less digits than its factorization.
324403030000131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2922549819861.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 324403030000131 its reverse (131000030304423), we get a palindrome (455403060304554).
The spelling of 324403030000131 in words is "three hundred twenty-four trillion, four hundred three billion, thirty million, one hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •