Base | Representation |
---|---|
bin | 1011111111101010001… |
… | …10100001101101111101 |
3 | 1110101210022212112222112 |
4 | 11333311012201231331 |
5 | 23223022302201023 |
6 | 513155354223405 |
7 | 41530031246330 |
oct | 5776506415575 |
9 | 1411708775875 |
10 | 412134022013 |
11 | 14986aa0276a |
12 | 67a5aa24b65 |
13 | 2cb3049921c |
14 | 15d3990a617 |
15 | aac1cde478 |
hex | 5ff51a1b7d |
412134022013 has 32 divisors (see below), whose sum is σ = 489397248000. Its totient is φ = 339734070144.
The previous prime is 412134022009. The next prime is 412134022031. The reversal of 412134022013 is 310220431214.
It is not a de Polignac number, because 412134022013 - 22 = 412134022009 is a prime.
It is a super-2 number, since 2×4121340220132 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 412134022013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (412134022613) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 88647713 + ... + 88652361.
It is an arithmetic number, because the mean of its divisors is an integer number (15293664000).
Almost surely, 2412134022013 is an apocalyptic number.
It is an amenable number.
412134022013 is a deficient number, since it is larger than the sum of its proper divisors (77263225987).
412134022013 is a wasteful number, since it uses less digits than its factorization.
412134022013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9329.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 412134022013 its reverse (310220431214), we get a palindrome (722354453227).
The spelling of 412134022013 in words is "four hundred twelve billion, one hundred thirty-four million, twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •