Base | Representation |
---|---|
bin | 1011000010010000001000… |
… | …1111100000010011010101 |
3 | 1120221221012221121111212111 |
4 | 2300210002033200103111 |
5 | 3042243014434330401 |
6 | 41445545333151021 |
7 | 2361413662200010 |
oct | 260440217402325 |
9 | 46857187544774 |
10 | 12133320230101 |
11 | 3958791a55a54 |
12 | 143b62848b471 |
13 | 6a022340a7c5 |
14 | 2dd38200c377 |
15 | 1609374d0e51 |
hex | b09023e04d5 |
12133320230101 has 16 divisors (see below), whose sum is σ = 13897191333888. Its totient is φ = 10377085950000.
The previous prime is 12133320230099. The next prime is 12133320230107. The reversal of 12133320230101 is 10103202333121.
It is not a de Polignac number, because 12133320230101 - 21 = 12133320230099 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 (12133320230107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 93116886 + ... + 93247096.
It is an arithmetic number, because the mean of its divisors is an integer number (868574458368).
Almost surely, 212133320230101 is an apocalyptic number.
It is an amenable number.
12133320230101 is a deficient number, since it is larger than the sum of its proper divisors (1763871103787).
12133320230101 is a wasteful number, since it uses less digits than its factorization.
12133320230101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159432.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 12133320230101 its reverse (10103202333121), we get a palindrome (22236522563222).
The spelling of 12133320230101 in words is "twelve trillion, one hundred thirty-three billion, three hundred twenty million, two hundred thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •