Base | Representation |
---|---|
bin | 11000111111000111… |
… | …11111010101001111 |
3 | 1021121212121122120220 |
4 | 30133203333111033 |
5 | 204433043230111 |
6 | 10055033442423 |
7 | 653264526312 |
oct | 143743772517 |
9 | 37555548526 |
10 | 13414430031 |
11 | 5764106912 |
12 | 2724570413 |
13 | 135a1c6382 |
14 | 913808979 |
15 | 537a15e06 |
hex | 31f8ff54f |
13414430031 has 8 divisors (see below), whose sum is σ = 18369309744. Its totient is φ = 8701251840.
The previous prime is 13414429997. The next prime is 13414430033. The reversal of 13414430031 is 13003441431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13414430031 - 223 = 13406041423 is a prime.
It is a super-2 number, since 2×134144300312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13414429983 and 13414430010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13414430033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 60425250 + ... + 60425471.
It is an arithmetic number, because the mean of its divisors is an integer number (2296163718).
Almost surely, 213414430031 is an apocalyptic number.
13414430031 is a deficient number, since it is larger than the sum of its proper divisors (4954879713).
13414430031 is a wasteful number, since it uses less digits than its factorization.
13414430031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120850761.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 13414430031 its reverse (13003441431), we get a palindrome (26417871462).
The spelling of 13414430031 in words is "thirteen billion, four hundred fourteen million, four hundred thirty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •