Base | Representation |
---|---|
bin | 10100100101010010001… |
… | …000001101011100010110 |
3 | 12000012212111202121202002 |
4 | 110211102020031130112 |
5 | 141133214030434220 |
6 | 3001435422515302 |
7 | 204121461454466 |
oct | 24452210153426 |
9 | 5005774677662 |
10 | 1414422124310 |
11 | 4a5942462798 |
12 | 1aa15b135b32 |
13 | a34c1802640 |
14 | 4c65bba5ba6 |
15 | 26bd4376c75 |
hex | 1495220d716 |
1414422124310 has 32 divisors (see below), whose sum is σ = 2903085414432. Its totient is φ = 491527687680.
The previous prime is 1414422124301. The next prime is 1414422124321. The reversal of 1414422124310 is 134212244141.
It is a super-2 number, since 2×14144221243102 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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, 320002796 + ... + 320007215.
It is an arithmetic number, because the mean of its divisors is an integer number (90721419201).
Almost surely, 21414422124310 is an apocalyptic number.
1414422124310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1414422124310 is an abundant number, since it is smaller than the sum of its proper divisors (1488663290122).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1414422124310 is a wasteful number, since it uses less digits than its factorization.
1414422124310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 640010048.
The product of its (nonzero) digits is 6144, while the sum is 29.
Adding to 1414422124310 its reverse (134212244141), we get a palindrome (1548634368451).
The spelling of 1414422124310 in words is "one trillion, four hundred fourteen billion, four hundred twenty-two million, one hundred twenty-four thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •