Base | Representation |
---|---|
bin | 110111111000111010… |
… | …0111101111101000011 |
3 | 102110210111021100002211 |
4 | 1233301310331331003 |
5 | 3431300423430144 |
6 | 131045333122551 |
7 | 11446145212321 |
oct | 1576164757503 |
9 | 373714240084 |
10 | 120021311299 |
11 | 4699a9a066a |
12 | 1b316a89457 |
13 | b4197395c6 |
14 | 5b480d2d11 |
15 | 31c6cb5034 |
hex | 1bf1d3df43 |
120021311299 has 4 divisors (see below), whose sum is σ = 126338222440. Its totient is φ = 113704400160.
The previous prime is 120021311297. The next prime is 120021311321. The reversal of 120021311299 is 992113120021.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 992113120021 = 1901 ⋅521890121.
It is a cyclic number.
It is not a de Polignac number, because 120021311299 - 21 = 120021311297 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 120021311299.
It is not an unprimeable number, because it can be changed into a prime (120021311297) 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, 3158455542 + ... + 3158455579.
It is an arithmetic number, because the mean of its divisors is an integer number (31584555610).
Almost surely, 2120021311299 is an apocalyptic number.
120021311299 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
120021311299 is a deficient number, since it is larger than the sum of its proper divisors (6316911141).
120021311299 is an equidigital number, since it uses as much as digits as its factorization.
120021311299 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6316911140.
The product of its (nonzero) digits is 1944, while the sum is 31.
The spelling of 120021311299 in words is "one hundred twenty billion, twenty-one million, three hundred eleven thousand, two hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •