Base | Representation |
---|---|
bin | 100011011010110101110… |
… | …010100010000000000101 |
3 | 22121200120202001220211012 |
4 | 203122311302202000011 |
5 | 304334313330141401 |
6 | 5102055333252005 |
7 | 340564552432310 |
oct | 43326562420005 |
9 | 8550522056735 |
10 | 2434001412101 |
11 | 859288385366 |
12 | 333886194005 |
13 | 1486aa261b6c |
14 | 85b4069b977 |
15 | 434a99538bb |
hex | 236b5ca2005 |
2434001412101 has 16 divisors (see below), whose sum is σ = 3100364472960. Its totient is φ = 1860218680320.
The previous prime is 2434001412091. The next prime is 2434001412127. The reversal of 2434001412101 is 1012141004342.
It is not a de Polignac number, because 2434001412101 - 226 = 2433934303237 is a prime.
It is a super-3 number, since 3×24340014121013 (a number of 38 digits) contains 333 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2434001412131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 538255460 + ... + 538259981.
It is an arithmetic number, because the mean of its divisors is an integer number (193772779560).
Almost surely, 22434001412101 is an apocalyptic number.
It is an amenable number.
2434001412101 is a deficient number, since it is larger than the sum of its proper divisors (666363060859).
2434001412101 is a wasteful number, since it uses less digits than its factorization.
2434001412101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1076515484.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 2434001412101 its reverse (1012141004342), we get a palindrome (3446142416443).
The spelling of 2434001412101 in words is "two trillion, four hundred thirty-four billion, one million, four hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •