Base | Representation |
---|---|
bin | 11011010101010100010101… |
… | …011111111011101100010011 |
3 | 120202122011200221011012221022 |
4 | 123111110111133323230103 |
5 | 111224024041241341433 |
6 | 1103400420014350055 |
7 | 34215021250260224 |
oct | 3325242537735423 |
9 | 522564627135838 |
10 | 120212200340243 |
11 | 35337787191630 |
12 | 11595b1a7bb32b |
13 | 520cc6725678b |
14 | 21984315dd24b |
15 | dd6eddc20698 |
hex | 6d55157fbb13 |
120212200340243 has 8 divisors (see below), whose sum is σ = 131188287054000. Its totient is φ = 109244064437280.
The previous prime is 120212200340191. The next prime is 120212200340261. The reversal of 120212200340243 is 342043002212021.
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 120212200340243 - 236 = 120143480863507 is a prime.
It is a super-2 number, since 2×1202122003402432 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (120212200340263) 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, 1987671080 + ... + 1987731557.
It is an arithmetic number, because the mean of its divisors is an integer number (16398535881750).
Almost surely, 2120212200340243 is an apocalyptic number.
120212200340243 is a deficient number, since it is larger than the sum of its proper divisors (10976086713757).
120212200340243 is a wasteful number, since it uses less digits than its factorization.
120212200340243 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3975405397.
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 120212200340243 its reverse (342043002212021), we get a palindrome (462255202552264).
The spelling of 120212200340243 in words is "one hundred twenty trillion, two hundred twelve billion, two hundred million, three hundred forty thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •