Base | Representation |
---|---|
bin | 11011010101010101011101… |
… | …001000011011110111011001 |
3 | 120202122021210200112222102220 |
4 | 123111111131020123313121 |
5 | 111224034021421440441 |
6 | 1103401135145214253 |
7 | 34215063112353033 |
oct | 3325253510336731 |
9 | 522567720488386 |
10 | 120213402140121 |
11 | 35338243607674 |
12 | 115961b5191389 |
13 | 52100c922b274 |
14 | 219850707ac53 |
15 | dd705e4b4466 |
hex | 6d555d21bdd9 |
120213402140121 has 8 divisors (see below), whose sum is σ = 160290584537664. Its totient is φ = 80139243918000.
The previous prime is 120213402140119. The next prime is 120213402140129. The reversal of 120213402140121 is 121041204312021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 120213402140121 - 21 = 120213402140119 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 120213402140091 and 120213402140100.
It is not an unprimeable number, because it can be changed into a prime (120213402140129) 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, 755951101 + ... + 756110106.
It is an arithmetic number, because the mean of its divisors is an integer number (20036323067208).
Almost surely, 2120213402140121 is an apocalyptic number.
It is an amenable number.
120213402140121 is a deficient number, since it is larger than the sum of its proper divisors (40077182397543).
120213402140121 is a wasteful number, since it uses less digits than its factorization.
120213402140121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1512087711.
The product of its (nonzero) digits is 768, while the sum is 24.
Adding to 120213402140121 its reverse (121041204312021), we get a palindrome (241254606452142).
The spelling of 120213402140121 in words is "one hundred twenty trillion, two hundred thirteen billion, four hundred two million, one hundred forty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •