Base | Representation |
---|---|
bin | 1011111101111110100… |
… | …10100111010100101010 |
3 | 1110022110102002111212020 |
4 | 11332333102213110222 |
5 | 23214200143033114 |
6 | 512530024125310 |
7 | 41465456463444 |
oct | 5767722472452 |
9 | 1408412074766 |
10 | 411231221034 |
11 | 149447337a57 |
12 | 67848606836 |
13 | 2ca1843196a |
14 | 15c91a61494 |
15 | aa6c90caa9 |
hex | 5fbf4a752a |
411231221034 has 8 divisors (see below), whose sum is σ = 822462442080. Its totient is φ = 137077073676.
The previous prime is 411231221033. The next prime is 411231221077. The reversal of 411231221034 is 430122132114.
It is a sphenic number, since it is the product of 3 distinct primes.
411231221034 is an admirable number.
It is a super-2 number, since 2×4112312210342 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 411231220995 and 411231221013.
It is not an unprimeable number, because it can be changed into a prime (411231221033) 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, 34269268414 + ... + 34269268425.
It is an arithmetic number, because the mean of its divisors is an integer number (102807805260).
Almost surely, 2411231221034 is an apocalyptic number.
411231221034 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
411231221034 is a wasteful number, since it uses less digits than its factorization.
411231221034 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 68538536844.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 411231221034 its reverse (430122132114), we get a palindrome (841353353148).
The spelling of 411231221034 in words is "four hundred eleven billion, two hundred thirty-one million, two hundred twenty-one thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •