Base | Representation |
---|---|
bin | 1010111010011111111001… |
… | …1010011011110011001001 |
3 | 1120111012101102211022012001 |
4 | 2232213332122123303021 |
5 | 3033102212133001301 |
6 | 41304435250351001 |
7 | 2345656651004503 |
oct | 256477632336311 |
9 | 46435342738161 |
10 | 12000112000201 |
11 | 3907245422256 |
12 | 141985128b461 |
13 | 6907b49754b0 |
14 | 2d6b46814d73 |
15 | 15c23cb95c01 |
hex | ae9fe69bcc9 |
12000112000201 has 8 divisors (see below), whose sum is σ = 13051149990984. Its totient is φ = 10967352931200.
The previous prime is 12000112000153. The next prime is 12000112000231. The reversal of 12000112000201 is 10200021100021.
It can be written as a sum of positive squares in 4 ways, for example, as 162934129801 + 11837177870400 = 403651^2 + 3440520^2 .
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 12000112000201 - 215 = 12000111967433 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12000112000231) 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, 4569729076 + ... + 4569731701.
It is an arithmetic number, because the mean of its divisors is an integer number (1631393748873).
Almost surely, 212000112000201 is an apocalyptic number.
It is an amenable number.
12000112000201 is a deficient number, since it is larger than the sum of its proper divisors (1051037990783).
12000112000201 is a wasteful number, since it uses less digits than its factorization.
12000112000201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9139460891.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 12000112000201 its reverse (10200021100021), we get a palindrome (22200133100222).
The spelling of 12000112000201 in words is "twelve trillion, one hundred twelve million, two hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •