Base | Representation |
---|---|
bin | 11011010101011110100000… |
… | …111101101010111000010001 |
3 | 120202200012220122102201012221 |
4 | 123111132200331222320101 |
5 | 111224213432301301223 |
6 | 1103405424333221041 |
7 | 34215556144601536 |
oct | 3325364075527021 |
9 | 522605818381187 |
10 | 120223130103313 |
11 | 35341385807376 |
12 | 1159806b031781 |
13 | 5210cb975b7c3 |
14 | 2198b8b028d8d |
15 | dd742d538b5d |
hex | 6d57a0f6ae11 |
120223130103313 has 2 divisors, whose sum is σ = 120223130103314. Its totient is φ = 120223130103312.
The previous prime is 120223130103311. The next prime is 120223130103341. The reversal of 120223130103313 is 313301031322021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 110735886164544 + 9487243938769 = 10523112^2 + 3080137^2 .
It is a cyclic number.
It is not a de Polignac number, because 120223130103313 - 21 = 120223130103311 is a prime.
Together with 120223130103311, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (120223130103311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60111565051656 + 60111565051657.
It is an arithmetic number, because the mean of its divisors is an integer number (60111565051657).
Almost surely, 2120223130103313 is an apocalyptic number.
It is an amenable number.
120223130103313 is a deficient number, since it is larger than the sum of its proper divisors (1).
120223130103313 is an equidigital number, since it uses as much as digits as its factorization.
120223130103313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 120223130103313 its reverse (313301031322021), we get a palindrome (433524161425334).
The spelling of 120223130103313 in words is "one hundred twenty trillion, two hundred twenty-three billion, one hundred thirty million, one hundred three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •