Base | Representation |
---|---|
bin | 1011111101000011110011… |
… | …0111001111111101111110 |
3 | 1201112111222112211101220001 |
4 | 2333100330313033331332 |
5 | 3210321113441321141 |
6 | 43542032433544514 |
7 | 2524411116331525 |
oct | 277207467177576 |
9 | 51474875741801 |
10 | 13143621042046 |
11 | 42081a6474370 |
12 | 15833a411513a |
13 | 7445907b7031 |
14 | 33622451d4bc |
15 | 17bd68224a31 |
hex | bf43cdcff7e |
13143621042046 has 64 divisors (see below), whose sum is σ = 21864026935296. Its totient is φ = 5876225222400.
The previous prime is 13143621042037. The next prime is 13143621042053. The reversal of 13143621042046 is 64024012634131.
It is a super-2 number, since 2×131436210420462 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13143621041996 and 13143621042014.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1050558931 + ... + 1050571441.
It is an arithmetic number, because the mean of its divisors is an integer number (341625420864).
Almost surely, 213143621042046 is an apocalyptic number.
13143621042046 is a deficient number, since it is larger than the sum of its proper divisors (8720405893250).
13143621042046 is a wasteful number, since it uses less digits than its factorization.
13143621042046 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15737.
The product of its (nonzero) digits is 82944, while the sum is 37.
Adding to 13143621042046 its reverse (64024012634131), we get a palindrome (77167633676177).
The spelling of 13143621042046 in words is "thirteen trillion, one hundred forty-three billion, six hundred twenty-one million, forty-two thousand, forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •