Base | Representation |
---|---|
bin | 101110110111001010000110… |
… | …0111111011001000000110001 |
3 | 2000001111001010101021022122102 |
4 | 1131232110030333121000301 |
5 | 413012000340221234441 |
6 | 4020402324441150145 |
7 | 152552355605546150 |
oct | 13556241477310061 |
9 | 2001431111238572 |
10 | 412201114243121 |
11 | 10a381568a24a85 |
12 | 3a29340718b355 |
13 | 14900524056458 |
14 | 73b08d72b3597 |
15 | 329c46c21e69b |
hex | 176e50cfd9031 |
412201114243121 has 8 divisors (see below), whose sum is σ = 478809725210304. Its totient is φ = 347523187651920.
The previous prime is 412201114243117. The next prime is 412201114243133. The reversal of 412201114243121 is 121342411102214.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 412201114243121 - 22 = 412201114243117 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (412201114243111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 482671093535 + ... + 482671094388.
It is an arithmetic number, because the mean of its divisors is an integer number (59851215651288).
Almost surely, 2412201114243121 is an apocalyptic number.
It is an amenable number.
412201114243121 is a deficient number, since it is larger than the sum of its proper divisors (66608610967183).
412201114243121 is an equidigital number, since it uses as much as digits as its factorization.
412201114243121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 965342187991.
The product of its (nonzero) digits is 3072, while the sum is 29.
Adding to 412201114243121 its reverse (121342411102214), we get a palindrome (533543525345335).
The spelling of 412201114243121 in words is "four hundred twelve trillion, two hundred one billion, one hundred fourteen million, two hundred forty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •