Base | Representation |
---|---|
bin | 10010000100000100100… |
… | …000001101001100000001 |
3 | 11101200001210122111000210 |
4 | 102010010200031030001 |
5 | 130314211200200113 |
6 | 2350131031104333 |
7 | 155453044154310 |
oct | 22040440151401 |
9 | 4350053574023 |
10 | 1241321100033 |
11 | 439494444143 |
12 | 1806abb120a9 |
13 | 90096282261 |
14 | 4411a34a277 |
15 | 2245267e6c3 |
hex | 1210480d301 |
1241321100033 has 16 divisors (see below), whose sum is σ = 1891606255616. Its totient is φ = 709300339920.
The previous prime is 1241321100017. The next prime is 1241321100163. The reversal of 1241321100033 is 3300011231421.
It is not a de Polignac number, because 1241321100033 - 24 = 1241321100017 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 1241321099982 and 1241321100009.
It is not an unprimeable number, because it can be changed into a prime (1241321000033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 489391 + ... + 1649892.
It is an arithmetic number, because the mean of its divisors is an integer number (118225390976).
Almost surely, 21241321100033 is an apocalyptic number.
It is an amenable number.
1241321100033 is a deficient number, since it is larger than the sum of its proper divisors (650285155583).
1241321100033 is a wasteful number, since it uses less digits than its factorization.
1241321100033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2166924.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 1241321100033 its reverse (3300011231421), we get a palindrome (4541332331454).
The spelling of 1241321100033 in words is "one trillion, two hundred forty-one billion, three hundred twenty-one million, one hundred thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •