Base | Representation |
---|---|
bin | 11011010101010110000111… |
… | …111011000001001101001101 |
3 | 120202122100122201102020112001 |
4 | 123111112013323001031031 |
5 | 111224042004212341331 |
6 | 1103401334312312301 |
7 | 34215116650421242 |
oct | 3325260773011515 |
9 | 522570581366461 |
10 | 120214120043341 |
11 | 35338581874a15 |
12 | 115963756a2691 |
13 | 52101b1b9857c |
14 | 21985745555c9 |
15 | dd70a2521561 |
hex | 6d5587ec134d |
120214120043341 has 8 divisors (see below), whose sum is σ = 121861515594240. Its totient is φ = 118566741432672.
The previous prime is 120214120043273. The next prime is 120214120043363. The reversal of 120214120043341 is 143340021412021.
It is a happy number.
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 120214120043341 - 227 = 120213985825613 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120214120043371) 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, 10399050 + ... + 18669988.
It is an arithmetic number, because the mean of its divisors is an integer number (15232689449280).
Almost surely, 2120214120043341 is an apocalyptic number.
It is an amenable number.
120214120043341 is a deficient number, since it is larger than the sum of its proper divisors (1647395550899).
120214120043341 is an equidigital number, since it uses as much as digits as its factorization.
120214120043341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8470115.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 120214120043341 its reverse (143340021412021), we get a palindrome (263554141455362).
The spelling of 120214120043341 in words is "one hundred twenty trillion, two hundred fourteen billion, one hundred twenty million, forty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •