Base | Representation |
---|---|
bin | 1011000001011111010101… |
… | …1010111011111001011111 |
3 | 1120220200101222122002202002 |
4 | 2300113311122323321133 |
5 | 3042034202334033043 |
6 | 41435541410352515 |
7 | 2360441233021505 |
oct | 260276532737137 |
9 | 46820358562662 |
10 | 12120220221023 |
11 | 395317a383272 |
12 | 1438b9128b73b |
13 | 69bc163c1145 |
14 | 2dc89c28c675 |
15 | 16041c3c6bb8 |
hex | b05f56bbe5f |
12120220221023 has 8 divisors (see below), whose sum is σ = 12319956929328. Its totient is φ = 11921037568704.
The previous prime is 12120220220963. The next prime is 12120220221059. The reversal of 12120220221023 is 32012202202121.
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 12120220221023 - 224 = 12120203443807 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12120220220986 and 12120220221004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12120220221223) 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, 138469886 + ... + 138557387.
It is an arithmetic number, because the mean of its divisors is an integer number (1539994616166).
Almost surely, 212120220221023 is an apocalyptic number.
12120220221023 is a deficient number, since it is larger than the sum of its proper divisors (199736708305).
12120220221023 is an equidigital number, since it uses as much as digits as its factorization.
12120220221023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 277027993.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 12120220221023 its reverse (32012202202121), we get a palindrome (44132422423144).
The spelling of 12120220221023 in words is "twelve trillion, one hundred twenty billion, two hundred twenty million, two hundred twenty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •