Base | Representation |
---|---|
bin | 1010111010100100000100… |
… | …0111011110010011111111 |
3 | 1120111022021102121121221102 |
4 | 2232221001013132103333 |
5 | 3033112010130300411 |
6 | 41305142304523315 |
7 | 2346026460142526 |
oct | 256510107362377 |
9 | 46438242547842 |
10 | 12001231103231 |
11 | 390776a0a4997 |
12 | 1419b0402053b |
13 | 690932784236 |
14 | 2d6c112c74bd |
15 | 15c2a6051d3b |
hex | aea411de4ff |
12001231103231 has 8 divisors (see below), whose sum is σ = 12388455088128. Its totient is φ = 11614012587000.
The previous prime is 12001231103189. The next prime is 12001231103233. The reversal of 12001231103231 is 13230113210021.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12001231103231 - 230 = 12000157361407 is a prime.
It is a super-2 number, since 2×120012311032312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12001231103233) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3351266 + ... + 5935776.
It is an arithmetic number, because the mean of its divisors is an integer number (1548556886016).
Almost surely, 212001231103231 is an apocalyptic number.
12001231103231 is a deficient number, since it is larger than the sum of its proper divisors (387223984897).
12001231103231 is a wasteful number, since it uses less digits than its factorization.
12001231103231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2734333.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 12001231103231 its reverse (13230113210021), we get a palindrome (25231344313252).
The spelling of 12001231103231 in words is "twelve trillion, one billion, two hundred thirty-one million, one hundred three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •