Base | Representation |
---|---|
bin | 111011110011110010001… |
… | …100111110110110010001 |
3 | 112112220202121100221201022 |
4 | 323303302030332312101 |
5 | 1014314341332140101 |
6 | 12424044255045225 |
7 | 602640632324234 |
oct | 73636214766621 |
9 | 15486677327638 |
10 | 4110052224401 |
11 | 1345077371742 |
12 | 564680210815 |
13 | 23a76507c346 |
14 | 102cdb43941b |
15 | 71da296ba1b |
hex | 3bcf233ed91 |
4110052224401 has 4 divisors (see below), whose sum is σ = 4111082574900. Its totient is φ = 4109021873904.
The previous prime is 4110052224371. The next prime is 4110052224463. The reversal of 4110052224401 is 1044222500114.
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 3036184276225 + 1073867948176 = 1742465^2 + 1036276^2 .
It is a cyclic number.
It is not a de Polignac number, because 4110052224401 - 234 = 4092872355217 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4110052229401) 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, 515169266 + ... + 515177243.
It is an arithmetic number, because the mean of its divisors is an integer number (1027770643725).
Almost surely, 24110052224401 is an apocalyptic number.
It is an amenable number.
4110052224401 is a deficient number, since it is larger than the sum of its proper divisors (1030350499).
4110052224401 is a wasteful number, since it uses less digits than its factorization.
4110052224401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1030350498.
The product of its (nonzero) digits is 2560, while the sum is 26.
Adding to 4110052224401 its reverse (1044222500114), we get a palindrome (5154274724515).
The spelling of 4110052224401 in words is "four trillion, one hundred ten billion, fifty-two million, two hundred twenty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •