Base | Representation |
---|---|
bin | 11011010101010101010111… |
… | …110100110010010010100011 |
3 | 120202122021120111000102111011 |
4 | 123111111113310302102203 |
5 | 111224033331123244021 |
6 | 1103401122245001351 |
7 | 34215060651510442 |
oct | 3325252764622243 |
9 | 522567514012434 |
10 | 120213313103011 |
11 | 353381a8323787 |
12 | 1159618b3b3257 |
13 | 52100b395569b |
14 | 21984d9300d59 |
15 | dd7056777de1 |
hex | 6d5557d324a3 |
120213313103011 has 4 divisors (see below), whose sum is σ = 120553860732552. Its totient is φ = 119872765473472.
The previous prime is 120213313103003. The next prime is 120213313103021. The reversal of 120213313103011 is 110301313312021.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 120213313103011 - 23 = 120213313103003 is a prime.
It is a super-2 number, since 2×1202133131030112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120213313103021) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 170273814241 + ... + 170273814946.
It is an arithmetic number, because the mean of its divisors is an integer number (30138465183138).
Almost surely, 2120213313103011 is an apocalyptic number.
120213313103011 is a deficient number, since it is larger than the sum of its proper divisors (340547629541).
120213313103011 is an equidigital number, since it uses as much as digits as its factorization.
120213313103011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 340547629540.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 120213313103011 its reverse (110301313312021), we get a palindrome (230514626415032).
The spelling of 120213313103011 in words is "one hundred twenty trillion, two hundred thirteen billion, three hundred thirteen million, one hundred three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •