Base | Representation |
---|---|
bin | 1011010010000001101101… |
… | …0101101100010001000011 |
3 | 1121220211201200102201020100 |
4 | 2310200123111230101003 |
5 | 3111213024000101034 |
6 | 42214245021213443 |
7 | 2420116501131552 |
oct | 264403325542103 |
9 | 47824650381210 |
10 | 12404324222019 |
11 | 3a5270a709204 |
12 | 148405b101283 |
13 | 6bc951b7b482 |
14 | 30c5301b1d99 |
15 | 1679e9285099 |
hex | b481b56c443 |
12404324222019 has 24 divisors (see below), whose sum is σ = 19054893546000. Its totient is φ = 7748818564608.
The previous prime is 12404324222009. The next prime is 12404324222033. The reversal of 12404324222019 is 91022242340421.
12404324222019 is a `hidden beast` number, since 1 + 2 + 404 + 3 + 2 + 42 + 2 + 201 + 9 = 666.
It is not a de Polignac number, because 12404324222019 - 215 = 12404324189251 is a prime.
It is a super-2 number, since 2×124043242220192 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (12404324222009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 178542394 + ... + 178611855.
It is an arithmetic number, because the mean of its divisors is an integer number (793953897750).
Almost surely, 212404324222019 is an apocalyptic number.
12404324222019 is a deficient number, since it is larger than the sum of its proper divisors (6650569323981).
12404324222019 is a wasteful number, since it uses less digits than its factorization.
12404324222019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 357154499 (or 357154496 counting only the distinct ones).
The product of its (nonzero) digits is 55296, while the sum is 36.
The spelling of 12404324222019 in words is "twelve trillion, four hundred four billion, three hundred twenty-four million, two hundred twenty-two thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •