Base | Representation |
---|---|
bin | 11011010011101111111101… |
… | …010011101101100110011101 |
3 | 120202020212111112222221111220 |
4 | 123103233331103231212131 |
5 | 111220242323044114323 |
6 | 1103235113050203553 |
7 | 34204154333123205 |
oct | 3323577523554635 |
9 | 522225445887456 |
10 | 120104420301213 |
11 | 352a5aa9165007 |
12 | 1157905b4235b9 |
13 | 5202a4b95995a |
14 | 21931291b1405 |
15 | dd42d19890e3 |
hex | 6d3bfd4ed99d |
120104420301213 has 16 divisors (see below), whose sum is σ = 160871068197120. Its totient is φ = 79703834462784.
The previous prime is 120104420301211. The next prime is 120104420301401. The reversal of 120104420301213 is 312103024401021.
It is not a de Polignac number, because 120104420301213 - 21 = 120104420301211 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120104420301211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14288206 + ... + 21079887.
It is an arithmetic number, because the mean of its divisors is an integer number (10054441762320).
Almost surely, 2120104420301213 is an apocalyptic number.
It is an amenable number.
120104420301213 is a deficient number, since it is larger than the sum of its proper divisors (40766647895907).
120104420301213 is a wasteful number, since it uses less digits than its factorization.
120104420301213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35373268.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 120104420301213 its reverse (312103024401021), we get a palindrome (432207444702234).
The spelling of 120104420301213 in words is "one hundred twenty trillion, one hundred four billion, four hundred twenty million, three hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •