Base | Representation |
---|---|
bin | 1010111100010111000110… |
… | …1101011011011001101111 |
3 | 1120121020222111211112101211 |
4 | 2233011301231123121233 |
5 | 3034113230422131343 |
6 | 41331250415015251 |
7 | 2351201634062662 |
oct | 257056155333157 |
9 | 46536874745354 |
10 | 12032111130223 |
11 | 3919876069258 |
12 | 1423aa180a527 |
13 | 69381426b962 |
14 | 2d850056d6d9 |
15 | 15ceb205e79d |
hex | af171b5b66f |
12032111130223 has 4 divisors (see below), whose sum is σ = 12037475426328. Its totient is φ = 12026746834120.
The previous prime is 12032111130181. The next prime is 12032111130251. The reversal of 12032111130223 is 32203111123021.
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 12032111130223 - 29 = 12032111129711 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12032111130194 and 12032111130203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12032111130253) 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, 2682144688 + ... + 2682149173.
It is an arithmetic number, because the mean of its divisors is an integer number (3009368856582).
Almost surely, 212032111130223 is an apocalyptic number.
12032111130223 is a deficient number, since it is larger than the sum of its proper divisors (5364296105).
12032111130223 is an equidigital number, since it uses as much as digits as its factorization.
12032111130223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5364296104.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 12032111130223 its reverse (32203111123021), we get a palindrome (44235222253244).
The spelling of 12032111130223 in words is "twelve trillion, thirty-two billion, one hundred eleven million, one hundred thirty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •