Base | Representation |
---|---|
bin | 111000011100000100… |
… | …1001011000100101001 |
3 | 102120211201002101122122 |
4 | 1300320021023010221 |
5 | 3441204424404113 |
6 | 131402354201025 |
7 | 11520321420062 |
oct | 1607011130451 |
9 | 376751071578 |
10 | 121201013033 |
11 | 474458a2a81 |
12 | 1b5a5b83175 |
13 | b576c74979 |
14 | 5c1aa5b569 |
15 | 3245641408 |
hex | 1c3824b129 |
121201013033 has 8 divisors (see below), whose sum is σ = 127435775880. Its totient is φ = 115103278080.
The previous prime is 121201012943. The next prime is 121201013039. The reversal of 121201013033 is 330310102121.
It can be written as a sum of positive squares in 4 ways, for example, as 19508267584 + 101692745449 = 139672^2 + 318893^2 .
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 121201013033 - 218 = 121200750889 is a prime.
It is not an unprimeable number, because it can be changed into a prime (121201013039) 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, 34255160 + ... + 34258697.
It is an arithmetic number, because the mean of its divisors is an integer number (15929471985).
Almost surely, 2121201013033 is an apocalyptic number.
It is an amenable number.
121201013033 is a deficient number, since it is larger than the sum of its proper divisors (6234762847).
121201013033 is an equidigital number, since it uses as much as digits as its factorization.
121201013033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68513947.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 121201013033 its reverse (330310102121), we get a palindrome (451511115154).
It can be divided in two parts, 1212010 and 13033, that added together give a cube (1225043 = 1073).
The spelling of 121201013033 in words is "one hundred twenty-one billion, two hundred one million, thirteen thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •