Base | Representation |
---|---|
bin | 1010111011000110101110… |
… | …0101010011100001110001 |
3 | 1120112012021201201101202122 |
4 | 2232301223211103201301 |
5 | 3033240033034013131 |
6 | 41313321331324025 |
7 | 2346506134211045 |
oct | 256615345234161 |
9 | 46465251641678 |
10 | 12010533501041 |
11 | 3910703058069 |
12 | 141b87b450615 |
13 | 691785a9183a |
14 | 2d7454938025 |
15 | 15c64ca62d7b |
hex | aec6b953871 |
12010533501041 has 8 divisors (see below), whose sum is σ = 12084462211584. Its totient is φ = 11936719856880.
The previous prime is 12010533501023. The next prime is 12010533501053. The reversal of 12010533501041 is 14010533501021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12010533501041 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12010533501041.
It is not an unprimeable number, because it can be changed into a prime (12010533501011) 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, 28557191 + ... + 28974716.
It is an arithmetic number, because the mean of its divisors is an integer number (1510557776448).
Almost surely, 212010533501041 is an apocalyptic number.
It is an amenable number.
12010533501041 is a deficient number, since it is larger than the sum of its proper divisors (73928710543).
12010533501041 is a wasteful number, since it uses less digits than its factorization.
12010533501041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57533191.
The product of its (nonzero) digits is 1800, while the sum is 26.
The spelling of 12010533501041 in words is "twelve trillion, ten billion, five hundred thirty-three million, five hundred one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •