Base | Representation |
---|---|
bin | 1010111100011010100010… |
… | …0011101101100100111111 |
3 | 1120121100100122100112100011 |
4 | 2233012220203231210333 |
5 | 3034122122010030421 |
6 | 41331522010044051 |
7 | 2351233506462331 |
oct | 257065043554477 |
9 | 46540318315304 |
10 | 12033031330111 |
11 | 391a1a8538030 |
12 | 14240b9a19627 |
13 | 69392cab872c |
14 | 2d858a867451 |
15 | 15d017c2b4e1 |
hex | af1a88ed93f |
12033031330111 has 4 divisors (see below), whose sum is σ = 13126943269224. Its totient is φ = 10939119391000.
The previous prime is 12033031330109. The next prime is 12033031330121. The reversal of 12033031330111 is 11103313033021.
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 12033031330111 - 21 = 12033031330109 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12033031330121) 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, 546955969540 + ... + 546955969561.
It is an arithmetic number, because the mean of its divisors is an integer number (3281735817306).
Almost surely, 212033031330111 is an apocalyptic number.
12033031330111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
12033031330111 is a deficient number, since it is larger than the sum of its proper divisors (1093911939113).
12033031330111 is a wasteful number, since it uses less digits than its factorization.
12033031330111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1093911939112.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 12033031330111 its reverse (11103313033021), we get a palindrome (23136344363132).
The spelling of 12033031330111 in words is "twelve trillion, thirty-three billion, thirty-one million, three hundred thirty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •