Base | Representation |
---|---|
bin | 1011000001100010010010… |
… | …0011101001010011010111 |
3 | 1120220202110002200112020210 |
4 | 2300120210203221103113 |
5 | 3042042312311031203 |
6 | 41440152100300503 |
7 | 2360466644560614 |
oct | 260304443512327 |
9 | 46822402615223 |
10 | 12121011033303 |
11 | 3953545809237 |
12 | 14391720a1733 |
13 | 69c0111a80c3 |
14 | 2dc93530550b |
15 | 160466a36803 |
hex | b06248e94d7 |
12121011033303 has 8 divisors (see below), whose sum is σ = 16682681852416. Its totient is φ = 7820007118200.
The previous prime is 12121011033283. The next prime is 12121011033319. The reversal of 12121011033303 is 30333011012121.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12121011033303 - 212 = 12121011029207 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12121011033303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12121011033203) 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, 65166725893 + ... + 65166726078.
It is an arithmetic number, because the mean of its divisors is an integer number (2085335231552).
Almost surely, 212121011033303 is an apocalyptic number.
12121011033303 is a deficient number, since it is larger than the sum of its proper divisors (4561670819113).
12121011033303 is a wasteful number, since it uses less digits than its factorization.
12121011033303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 130333452005.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 12121011033303 its reverse (30333011012121), we get a palindrome (42454022045424).
The spelling of 12121011033303 in words is "twelve trillion, one hundred twenty-one billion, eleven million, thirty-three thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •