Base | Representation |
---|---|
bin | 1010111011001000100011… |
… | …0001000001000010110011 |
3 | 1120112020112212000010102202 |
4 | 2232302020301001002303 |
5 | 3033242033404012243 |
6 | 41313442101333415 |
7 | 2346524230630256 |
oct | 256621061010263 |
9 | 46466485003382 |
10 | 12011023110323 |
11 | 3910934467836 |
12 | 141b99740726b |
13 | 691833349283 |
14 | 2d749d98709d |
15 | 15c67aa274b8 |
hex | aec88c410b3 |
12011023110323 has 4 divisors (see below), whose sum is σ = 12533241506448. Its totient is φ = 11488804714200.
The previous prime is 12011023110299. The next prime is 12011023110337. The reversal of 12011023110323 is 32301132011021.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12011023110323 - 226 = 12010956001459 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12011023110295 and 12011023110304.
It is not an unprimeable number, because it can be changed into a prime (12011023010323) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 261109198028 + ... + 261109198073.
It is an arithmetic number, because the mean of its divisors is an integer number (3133310376612).
Almost surely, 212011023110323 is an apocalyptic number.
12011023110323 is a deficient number, since it is larger than the sum of its proper divisors (522218396125).
12011023110323 is an equidigital number, since it uses as much as digits as its factorization.
12011023110323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 522218396124.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 12011023110323 its reverse (32301132011021), we get a palindrome (44312155121344).
The spelling of 12011023110323 in words is "twelve trillion, eleven billion, twenty-three million, one hundred ten thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •