Base | Representation |
---|---|
bin | 1010111011101110111100… |
… | …0110110011001001110111 |
3 | 1120120020011011021221212212 |
4 | 2232323233012303021313 |
5 | 3033424140441444343 |
6 | 41322304530404035 |
7 | 2350340523205322 |
oct | 256735706631167 |
9 | 46506134257785 |
10 | 12021330031223 |
11 | 3915243452a87 |
12 | 142199313061b |
13 | 6927b67b8736 |
14 | 2d7b9a7a17b9 |
15 | 15ca8080ec18 |
hex | aeeef1b3277 |
12021330031223 has 8 divisors (see below), whose sum is σ = 12171349239168. Its totient is φ = 11871434249784.
The previous prime is 12021330031201. The next prime is 12021330031331. The reversal of 12021330031223 is 32213003312021.
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 12021330031223 - 26 = 12021330031159 is a prime.
It is a super-4 number, since 4×120213300312234 (a number of 53 digits) contains 4444 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12021330036223) 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, 30660611 + ... + 31050212.
It is an arithmetic number, because the mean of its divisors is an integer number (1521418654896).
Almost surely, 212021330031223 is an apocalyptic number.
12021330031223 is a deficient number, since it is larger than the sum of its proper divisors (150019207945).
12021330031223 is an equidigital number, since it uses as much as digits as its factorization.
12021330031223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61713253.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 12021330031223 its reverse (32213003312021), we get a palindrome (44234333343244).
The spelling of 12021330031223 in words is "twelve trillion, twenty-one billion, three hundred thirty million, thirty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •