Base | Representation |
---|---|
bin | 1010111100011010011011… |
… | …0000011100011000001111 |
3 | 1120121100021112111100101201 |
4 | 2233012212300130120033 |
5 | 3034122041241104403 |
6 | 41331515010250331 |
7 | 2351232661601155 |
oct | 257064660343017 |
9 | 46540245440351 |
10 | 12033001113103 |
11 | 391a1924795a3 |
12 | 14240ab8869a7 |
13 | 693926768a49 |
14 | 2d858683d3d5 |
15 | 15d01525d21d |
hex | af1a6c1c60f |
12033001113103 has 8 divisors (see below), whose sum is σ = 12260114281008. Its totient is φ = 11805890738304.
The previous prime is 12033001113101. The next prime is 12033001113139. The reversal of 12033001113103 is 30131110033021.
12033001113103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 12033001113103 - 21 = 12033001113101 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 (12033001113101) 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, 9351351 + ... + 10560007.
It is an arithmetic number, because the mean of its divisors is an integer number (1532514285126).
Almost surely, 212033001113103 is an apocalyptic number.
12033001113103 is a deficient number, since it is larger than the sum of its proper divisors (227113167905).
12033001113103 is a wasteful number, since it uses less digits than its factorization.
12033001113103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1396553.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 12033001113103 its reverse (30131110033021), we get a palindrome (42164111146124).
The spelling of 12033001113103 in words is "twelve trillion, thirty-three billion, one million, one hundred thirteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •