Base | Representation |
---|---|
bin | 1011000000111110000111… |
… | …0011111100111110100101 |
3 | 1120212211101102002222100202 |
4 | 2300033201303330332211 |
5 | 3041412421113101013 |
6 | 41431504403120245 |
7 | 2360004223316630 |
oct | 260174163747645 |
9 | 46784342088322 |
10 | 12111301300133 |
11 | 394a41292aa72 |
12 | 1437302373085 |
13 | 69b12468b469 |
14 | 2dc293940c17 |
15 | 1600993b3858 |
hex | b03e1cfcfa5 |
12111301300133 has 32 divisors (see below), whose sum is σ = 14083450887168. Its totient is φ = 10200014035200.
The previous prime is 12111301300129. The next prime is 12111301300151. The reversal of 12111301300133 is 33100310311121.
It is a cyclic number.
It is not a de Polignac number, because 12111301300133 - 22 = 12111301300129 is a prime.
It is a super-2 number, since 2×121113013001332 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12111301300433) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2330438291 + ... + 2330443487.
It is an arithmetic number, because the mean of its divisors is an integer number (440107840224).
Almost surely, 212111301300133 is an apocalyptic number.
It is an amenable number.
12111301300133 is a deficient number, since it is larger than the sum of its proper divisors (1972149587035).
12111301300133 is a wasteful number, since it uses less digits than its factorization.
12111301300133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10053.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 12111301300133 its reverse (33100310311121), we get a palindrome (45211611611254).
The spelling of 12111301300133 in words is "twelve trillion, one hundred eleven billion, three hundred one million, three hundred thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •