Base | Representation |
---|---|
bin | 1011111100111011010011… |
… | …1110000000111010101111 |
3 | 1201112022002122202001121201 |
4 | 2333032310332000322233 |
5 | 3210301431311122111 |
6 | 43541014311110331 |
7 | 2524300453266214 |
oct | 277166476007257 |
9 | 51468078661551 |
10 | 13141341114031 |
11 | 4207236512739 |
12 | 1582a686723a7 |
13 | 7442b934bcc0 |
14 | 3360897d7b0b |
15 | 17bc82eba6c1 |
hex | bf3b4f80eaf |
13141341114031 has 4 divisors (see below), whose sum is σ = 14152213507432. Its totient is φ = 12130468720632.
The previous prime is 13141341113981. The next prime is 13141341114037. The reversal of 13141341114031 is 13041114314131.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13141341114031 - 29 = 13141341113519 is a prime.
It is a super-2 number, since 2×131413411140312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13141341114037) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 505436196681 + ... + 505436196706.
It is an arithmetic number, because the mean of its divisors is an integer number (3538053376858).
Almost surely, 213141341114031 is an apocalyptic number.
13141341114031 is a deficient number, since it is larger than the sum of its proper divisors (1010872393401).
13141341114031 is a wasteful number, since it uses less digits than its factorization.
13141341114031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1010872393400.
The product of its (nonzero) digits is 1728, while the sum is 28.
Adding to 13141341114031 its reverse (13041114314131), we get a palindrome (26182455428162).
The spelling of 13141341114031 in words is "thirteen trillion, one hundred forty-one billion, three hundred forty-one million, one hundred fourteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •