Base | Representation |
---|---|
bin | 101110110110100001010001… |
… | …0111010111101100000001111 |
3 | 2000001011122210212222010000121 |
4 | 1131231002202322331200033 |
5 | 413004031303422213210 |
6 | 4020254144254205411 |
7 | 152543133052346134 |
oct | 13555024272754017 |
9 | 2001148725863017 |
10 | 412113435351055 |
11 | 10a348365531709 |
12 | 3a27a4177b3867 |
13 | 148c5190089b29 |
14 | 73aa57a77a58b |
15 | 329a039a336da |
hex | 176d0a2ebd80f |
412113435351055 has 4 divisors (see below), whose sum is σ = 494536122421272. Its totient is φ = 329690748280840.
The previous prime is 412113435351043. The next prime is 412113435351071. The reversal of 412113435351055 is 550153534311214.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 412113435351055 - 227 = 412113301133327 is a prime.
It is a super-2 number, since 2×4121134353510552 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 41211343535101 + ... + 41211343535110.
It is an arithmetic number, because the mean of its divisors is an integer number (123634030605318).
Almost surely, 2412113435351055 is an apocalyptic number.
412113435351055 is a deficient number, since it is larger than the sum of its proper divisors (82422687070217).
412113435351055 is an equidigital number, since it uses as much as digits as its factorization.
412113435351055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 82422687070216.
The product of its (nonzero) digits is 540000, while the sum is 43.
Adding to 412113435351055 its reverse (550153534311214), we get a palindrome (962266969662269).
The spelling of 412113435351055 in words is "four hundred twelve trillion, one hundred thirteen billion, four hundred thirty-five million, three hundred fifty-one thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •