Base | Representation |
---|---|
bin | 111011110111110111110… |
… | …011111110100010011010 |
3 | 112120100002111012002201100 |
4 | 323313313303332202122 |
5 | 1014402333433100442 |
6 | 12430052004132230 |
7 | 603154456003326 |
oct | 73676763764232 |
9 | 15510074162640 |
10 | 4114441300122 |
11 | 1346a1993a24a |
12 | 5654a6097076 |
13 | 23acb4488b7a |
14 | 1031d630c986 |
15 | 7205ce4884c |
hex | 3bdf7cfe89a |
4114441300122 has 48 divisors (see below), whose sum is σ = 8936188639560. Its totient is φ = 1368166377600.
The previous prime is 4114441300069. The next prime is 4114441300129. The reversal of 4114441300122 is 2210031444114.
It can be written as a sum of positive squares in 4 ways, for example, as 2460565567161 + 1653875732961 = 1568619^2 + 1286031^2 .
It is a super-2 number, since 2×41144413001222 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (4114441300129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 13038972 + ... + 13350792.
Almost surely, 24114441300122 is an apocalyptic number.
4114441300122 is an abundant number, since it is smaller than the sum of its proper divisors (4821747339438).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4114441300122 is a wasteful number, since it uses less digits than its factorization.
4114441300122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 313599 (or 313596 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 27.
Adding to 4114441300122 its reverse (2210031444114), we get a palindrome (6324472744236).
The spelling of 4114441300122 in words is "four trillion, one hundred fourteen billion, four hundred forty-one million, three hundred thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •