Base | Representation |
---|---|
bin | 1010111011001000100011… |
… | …0001011110100100111101 |
3 | 1120112020112212020021101010 |
4 | 2232302020301132210331 |
5 | 3033242033421400133 |
6 | 41313442104105433 |
7 | 2346524231643042 |
oct | 256621061364475 |
9 | 46466485207333 |
10 | 12011023231293 |
11 | 391093453a709 |
12 | 141b997465279 |
13 | 69183338c358 |
14 | 2d749d9b91c9 |
15 | 15c67aa4d263 |
hex | aec88c5e93d |
12011023231293 has 8 divisors (see below), whose sum is σ = 16015618996288. Its totient is φ = 8006888143584.
The previous prime is 12011023231279. The next prime is 12011023231301. The reversal of 12011023231293 is 39213232011021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12011023231293 - 25 = 12011023231261 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 12011023231293.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12011023231213) 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, 115108480 + ... + 115212777.
It is an arithmetic number, because the mean of its divisors is an integer number (2001952374536).
Almost surely, 212011023231293 is an apocalyptic number.
It is an amenable number.
12011023231293 is a deficient number, since it is larger than the sum of its proper divisors (4004595764995).
12011023231293 is a wasteful number, since it uses less digits than its factorization.
12011023231293 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 230338643.
The product of its (nonzero) digits is 3888, while the sum is 30.
The spelling of 12011023231293 in words is "twelve trillion, eleven billion, twenty-three million, two hundred thirty-one thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •