Base | Representation |
---|---|
bin | 11101011111101001001… |
… | …10010111110110011111 |
3 | 10120212211001102121011121 |
4 | 32233310212113312133 |
5 | 113100441234430211 |
6 | 2053320441231411 |
7 | 133134342331000 |
oct | 16576446276637 |
9 | 3525731377147 |
10 | 1013421014431 |
11 | 360875819761 |
12 | 1444a8792567 |
13 | 74746958bb7 |
14 | 3709aa871a7 |
15 | 1b564b2d271 |
hex | ebf4997d9f |
1013421014431 has 32 divisors (see below), whose sum is σ = 1190695104000. Its totient is φ = 862146815040.
The previous prime is 1013421014423. The next prime is 1013421014443. The reversal of 1013421014431 is 1344101243101.
It is not a de Polignac number, because 1013421014431 - 23 = 1013421014423 is a prime.
It is a super-2 number, since 2×10134210144312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1013421014396 and 1013421014405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1013421014131) 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, 42534840 + ... + 42558658.
It is an arithmetic number, because the mean of its divisors is an integer number (37209222000).
Almost surely, 21013421014431 is an apocalyptic number.
1013421014431 is a deficient number, since it is larger than the sum of its proper divisors (177274089569).
1013421014431 is an equidigital number, since it uses as much as digits as its factorization.
1013421014431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24764 (or 24750 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 1013421014431 its reverse (1344101243101), we get a palindrome (2357522257532).
The spelling of 1013421014431 in words is "one trillion, thirteen billion, four hundred twenty-one million, fourteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.138 sec. • engine limits •