Base | Representation |
---|---|
bin | 1010111010100100000100… |
… | …1111111110101111100111 |
3 | 1120111022021120210220220201 |
4 | 2232221001033332233213 |
5 | 3033112011213130343 |
6 | 41305142424411331 |
7 | 2346026515121131 |
oct | 256510117765747 |
9 | 46438246726821 |
10 | 12001233333223 |
11 | 3907770388362 |
12 | 1419b04916b47 |
13 | 690933085264 |
14 | 2d6c11708051 |
15 | 15c2a634294d |
hex | aea413febe7 |
12001233333223 has 4 divisors (see below), whose sum is σ = 12113394392520. Its totient is φ = 11889072273928.
The previous prime is 12001233333163. The next prime is 12001233333241. The reversal of 12001233333223 is 32233333210021.
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 12001233333223 - 229 = 12000696462311 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12001233333191 and 12001233333200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12001233333253) 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, 56080529488 + ... + 56080529701.
It is an arithmetic number, because the mean of its divisors is an integer number (3028348598130).
Almost surely, 212001233333223 is an apocalyptic number.
12001233333223 is a deficient number, since it is larger than the sum of its proper divisors (112161059297).
12001233333223 is a wasteful number, since it uses less digits than its factorization.
12001233333223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112161059296.
The product of its (nonzero) digits is 11664, while the sum is 28.
Adding to 12001233333223 its reverse (32233333210021), we get a palindrome (44234566543244).
The spelling of 12001233333223 in words is "twelve trillion, one billion, two hundred thirty-three million, three hundred thirty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •