Base | Representation |
---|---|
bin | 1010111011001001001111… |
… | …1010110000011010011101 |
3 | 1120112021000220001221002022 |
4 | 2232302103322300122131 |
5 | 3033242424303304041 |
6 | 41313512423505525 |
7 | 2346531662160215 |
oct | 256622372603235 |
9 | 46467026057068 |
10 | 12011210213021 |
11 | 3910a20040868 |
12 | 141ba29bb82a5 |
13 | 691863039026 |
14 | 2d74ba76d245 |
15 | 15c68c18524b |
hex | aec93eb069d |
12011210213021 has 4 divisors (see below), whose sum is σ = 12214790047200. Its totient is φ = 11807630378844.
The previous prime is 12011210213017. The next prime is 12011210213071. The reversal of 12011210213021 is 12031201211021.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 12011210213021 - 22 = 12011210213017 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 (12011210213071) 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, 101789917001 + ... + 101789917118.
It is an arithmetic number, because the mean of its divisors is an integer number (3053697511800).
Almost surely, 212011210213021 is an apocalyptic number.
It is an amenable number.
12011210213021 is a deficient number, since it is larger than the sum of its proper divisors (203579834179).
12011210213021 is an equidigital number, since it uses as much as digits as its factorization.
12011210213021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 203579834178.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 12011210213021 its reverse (12031201211021), we get a palindrome (24042411424042).
The spelling of 12011210213021 in words is "twelve trillion, eleven billion, two hundred ten million, two hundred thirteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •