Base | Representation |
---|---|
bin | 1011111100111011111010… |
… | …0000101100101010000111 |
3 | 1201112022111210222022200212 |
4 | 2333032332200230222013 |
5 | 3210302243301413111 |
6 | 43541042230230035 |
7 | 2524304436100160 |
oct | 277167640545207 |
9 | 51468453868625 |
10 | 13141501201031 |
11 | 4207308914445 |
12 | 1582ab21b531b |
13 | 744313570238 |
14 | 3360a2b8a767 |
15 | 17bc9208d98b |
hex | bf3be82ca87 |
13141501201031 has 16 divisors (see below), whose sum is σ = 15866398172160. Its totient is φ = 10632769650720.
The previous prime is 13141501201027. The next prime is 13141501201039. The reversal of 13141501201031 is 13010210514131.
It is not a de Polignac number, because 13141501201031 - 22 = 13141501201027 is a prime.
It is a super-2 number, since 2×131415012010312 (a number of 27 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 = 13141501200988 and 13141501201006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13141501201039) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 178317455 + ... + 178391136.
It is an arithmetic number, because the mean of its divisors is an integer number (991649885760).
Almost surely, 213141501201031 is an apocalyptic number.
13141501201031 is a deficient number, since it is larger than the sum of its proper divisors (2724896971129).
13141501201031 is a wasteful number, since it uses less digits than its factorization.
13141501201031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 356708894.
The product of its (nonzero) digits is 360, while the sum is 23.
Adding to 13141501201031 its reverse (13010210514131), we get a palindrome (26151711715162).
The spelling of 13141501201031 in words is "thirteen trillion, one hundred forty-one billion, five hundred one million, two hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •