Base | Representation |
---|---|
bin | 1011111100111011111010… |
… | …1111001100101000111101 |
3 | 1201112022112002010102201011 |
4 | 2333032332233030220331 |
5 | 3210302300240031140 |
6 | 43541042443515221 |
7 | 2524304513310640 |
oct | 277167657145075 |
9 | 51468462112634 |
10 | 13141505002045 |
11 | 420730aa80182 |
12 | 1582ab3528b11 |
13 | 7443142a1364 |
14 | 3360a3499a57 |
15 | 17bc9258ecea |
hex | bf3bebcca3d |
13141505002045 has 64 divisors (see below), whose sum is σ = 19060397862912. Its totient is φ = 8506757376000.
The previous prime is 13141505002033. The next prime is 13141505002063. The reversal of 13141505002045 is 54020050514131.
It is not a de Polignac number, because 13141505002045 - 27 = 13141505001917 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a junction number, because it is equal to n+sod(n) for n = 13141505001998 and 13141505002016.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 419077507 + ... + 419108863.
It is an arithmetic number, because the mean of its divisors is an integer number (297818716608).
Almost surely, 213141505002045 is an apocalyptic number.
It is an amenable number.
13141505002045 is a deficient number, since it is larger than the sum of its proper divisors (5918892860867).
13141505002045 is a wasteful number, since it uses less digits than its factorization.
13141505002045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40862.
The product of its (nonzero) digits is 12000, while the sum is 31.
Adding to 13141505002045 its reverse (54020050514131), we get a palindrome (67161555516176).
The spelling of 13141505002045 in words is "thirteen trillion, one hundred forty-one billion, five hundred five million, two thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •