Base | Representation |
---|---|
bin | 1010111011000101100011… |
… | …1110000011000101111111 |
3 | 1120112011110222002220000102 |
4 | 2232301120332003011333 |
5 | 3033233413113021343 |
6 | 41313230334151315 |
7 | 2346465322652252 |
oct | 256613076030577 |
9 | 46464428086012 |
10 | 12010221220223 |
11 | 3910562855946 |
12 | 141b7b295253b |
13 | 691736183ca5 |
14 | 2d7425289099 |
15 | 15c63042a3b8 |
hex | aec58f8317f |
12010221220223 has 4 divisors (see below), whose sum is σ = 12011109366648. Its totient is φ = 12009333073800.
The previous prime is 12010221220181. The next prime is 12010221220241. The reversal of 12010221220223 is 32202212201021.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12010221220223 - 26 = 12010221220159 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12010221220195 and 12010221220204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12010221220423) 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, 444052928 + ... + 444079973.
It is an arithmetic number, because the mean of its divisors is an integer number (3002777341662).
Almost surely, 212010221220223 is an apocalyptic number.
12010221220223 is a deficient number, since it is larger than the sum of its proper divisors (888146425).
12010221220223 is an equidigital number, since it uses as much as digits as its factorization.
12010221220223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 888146424.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 12010221220223 its reverse (32202212201021), we get a palindrome (44212433421244).
The spelling of 12010221220223 in words is "twelve trillion, ten billion, two hundred twenty-one million, two hundred twenty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.133 sec. • engine limits •