Base | Representation |
---|---|
bin | 1010111011000101111110… |
… | …0001010101010001010101 |
3 | 1120112011202121221001000111 |
4 | 2232301133201111101111 |
5 | 3033234124232224023 |
6 | 41313245302043021 |
7 | 2346501126131563 |
oct | 256613741252125 |
9 | 46464677831014 |
10 | 12010331133013 |
11 | 39106098a7a64 |
12 | 141b823719471 |
13 | 691752b88745 |
14 | 2d7435adaa33 |
15 | 15c639ddc00d |
hex | aec5f855455 |
12010331133013 has 8 divisors (see below), whose sum is σ = 12532568200128. Its totient is φ = 11488098129024.
The previous prime is 12010331133011. The next prime is 12010331133023. The reversal of 12010331133013 is 31033113301021.
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 12010331133013 - 21 = 12010331133011 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12010331133011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6079045 + ... + 7808677.
It is an arithmetic number, because the mean of its divisors is an integer number (1566571025016).
Almost surely, 212010331133013 is an apocalyptic number.
It is an amenable number.
12010331133013 is a deficient number, since it is larger than the sum of its proper divisors (522237067115).
12010331133013 is a wasteful number, since it uses less digits than its factorization.
12010331133013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2031563.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 12010331133013 its reverse (31033113301021), we get a palindrome (43043444434034).
The spelling of 12010331133013 in words is "twelve trillion, ten billion, three hundred thirty-one million, one hundred thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •