Base | Representation |
---|---|
bin | 111100010000110011011… |
… | …010101010001110000001 |
3 | 112122220012010021211121010 |
4 | 330100303122222032001 |
5 | 1020322200020200113 |
6 | 12450240205551133 |
7 | 605123033361240 |
oct | 74206332521601 |
9 | 15586163254533 |
10 | 4141211100033 |
11 | 1357306783127 |
12 | 56a7172754a9 |
13 | 24068c56a367 |
14 | 10461574a957 |
15 | 72ac81ab1c3 |
hex | 3c4336aa381 |
4141211100033 has 32 divisors (see below), whose sum is σ = 6366596749056. Its totient is φ = 2345341114368.
The previous prime is 4141211099981. The next prime is 4141211100041. The reversal of 4141211100033 is 3300011121414.
It is not a de Polignac number, because 4141211100033 - 212 = 4141211095937 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 = 4141211099982 and 4141211100009.
It is not an unprimeable number, because it can be changed into a prime (4141211100073) 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 31 ways as a sum of consecutive naturals, for example, 63509235 + ... + 63574407.
It is an arithmetic number, because the mean of its divisors is an integer number (198956148408).
Almost surely, 24141211100033 is an apocalyptic number.
It is an amenable number.
4141211100033 is a deficient number, since it is larger than the sum of its proper divisors (2225385649023).
4141211100033 is a wasteful number, since it uses less digits than its factorization.
4141211100033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92073.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 4141211100033 its reverse (3300011121414), we get a palindrome (7441222221447).
The spelling of 4141211100033 in words is "four trillion, one hundred forty-one billion, two hundred eleven million, one hundred thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •