Base | Representation |
---|---|
bin | 1011000001100011000010… |
… | …0010010110100100001001 |
3 | 1120220202222002212202112121 |
4 | 2300120300202112210021 |
5 | 3042043220234133001 |
6 | 41440224040211241 |
7 | 2360504635130566 |
oct | 260306042264411 |
9 | 46822862782477 |
10 | 12121212021001 |
11 | 3953639206276 |
12 | 1439209469b21 |
13 | 69c043a19b35 |
14 | 2dc953ca386d |
15 | 1604794d86a1 |
hex | b0630896909 |
12121212021001 has 4 divisors (see below), whose sum is σ = 12132261440532. Its totient is φ = 12110162601472.
The previous prime is 12121212020989. The next prime is 12121212021073. The reversal of 12121212021001 is 10012021212121.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 7385887854601 + 4735324166400 = 2717699^2 + 2176080^2 .
It is a cyclic number.
It is not a de Polignac number, because 12121212021001 - 243 = 3325118998793 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12121218021001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5524708120 + ... + 5524710313.
It is an arithmetic number, because the mean of its divisors is an integer number (3033065360133).
Almost surely, 212121212021001 is an apocalyptic number.
It is an amenable number.
12121212021001 is a deficient number, since it is larger than the sum of its proper divisors (11049419531).
12121212021001 is a wasteful number, since it uses less digits than its factorization.
12121212021001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11049419530.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 12121212021001 its reverse (10012021212121), we get a palindrome (22133233233122).
The spelling of 12121212021001 in words is "twelve trillion, one hundred twenty-one billion, two hundred twelve million, twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •