Base | Representation |
---|---|
bin | 1010111100111011111111… |
… | …0010011100000110001111 |
3 | 1120122012112110012002101000 |
4 | 2233032333302130012033 |
5 | 3034244014304014411 |
6 | 41340005023351343 |
7 | 2352002154434451 |
oct | 257167762340617 |
9 | 46565473162330 |
10 | 12042011001231 |
11 | 3922a96303932 |
12 | 14259a5152553 |
13 | 69473129b9b3 |
14 | 2d8b9d2aa2d1 |
15 | 15d39123e956 |
hex | af3bfc9c18f |
12042011001231 has 32 divisors (see below), whose sum is σ = 17984815833600. Its totient is φ = 7962906294720.
The previous prime is 12042011001173. The next prime is 12042011001233. The reversal of 12042011001231 is 13210011024021.
12042011001231 is a `hidden beast` number, since 1 + 2 + 0 + 420 + 1 + 10 + 0 + 1 + 231 = 666.
It is not a de Polignac number, because 12042011001231 - 213 = 12042010993039 is a prime.
It is a super-2 number, since 2×120420110012312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12042011001233) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6573910 + ... + 8203676.
It is an arithmetic number, because the mean of its divisors is an integer number (562025494800).
Almost surely, 212042011001231 is an apocalyptic number.
12042011001231 is a deficient number, since it is larger than the sum of its proper divisors (5942804832369).
12042011001231 is a wasteful number, since it uses less digits than its factorization.
12042011001231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1631996 (or 1631990 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 12042011001231 its reverse (13210011024021), we get a palindrome (25252022025252).
The spelling of 12042011001231 in words is "twelve trillion, forty-two billion, eleven million, one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •