Base | Representation |
---|---|
bin | 110111111011011000… |
… | …0100001001100011001 |
3 | 102111000020220221012111 |
4 | 1233312300201030121 |
5 | 3431433112443001 |
6 | 131101450112321 |
7 | 11451201263533 |
oct | 1576660411431 |
9 | 374006827174 |
10 | 120104031001 |
11 | 46a3265a159 |
12 | 1b33a71b6a1 |
13 | b43090c886 |
14 | 5b550a6853 |
15 | 31ce1a4851 |
hex | 1bf6c21319 |
120104031001 has 4 divisors (see below), whose sum is σ = 122072949604. Its totient is φ = 118135112400.
The previous prime is 120104030941. The next prime is 120104031013. The reversal of 120104031001 is 100130401021.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 67548010000 + 52556021001 = 259900^2 + 229251^2 .
It is a cyclic number.
It is not a de Polignac number, because 120104031001 - 29 = 120104030489 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120104031031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 984459210 + ... + 984459331.
It is an arithmetic number, because the mean of its divisors is an integer number (30518237401).
Almost surely, 2120104031001 is an apocalyptic number.
It is an amenable number.
120104031001 is a deficient number, since it is larger than the sum of its proper divisors (1968918603).
120104031001 is an equidigital number, since it uses as much as digits as its factorization.
120104031001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1968918602.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 120104031001 its reverse (100130401021), we get a palindrome (220234432022).
The spelling of 120104031001 in words is "one hundred twenty billion, one hundred four million, thirty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •