Base | Representation |
---|---|
bin | 1011111101000110010101… |
… | …1101010010001000011110 |
3 | 1201112120202000100210011120 |
4 | 2333101211131102020132 |
5 | 3210324012314213042 |
6 | 43542224203231410 |
7 | 2524434026254311 |
oct | 277214535221036 |
9 | 51476660323146 |
10 | 13144302101022 |
11 | 4208515957024 |
12 | 1583554218566 |
13 | 74466b924001 |
14 | 33628ab66978 |
15 | 17bda7e04dec |
hex | bf46575221e |
13144302101022 has 16 divisors (see below), whose sum is σ = 27672214949760. Its totient is φ = 4150832242392.
The previous prime is 13144302100967. The next prime is 13144302101033. The reversal of 13144302101022 is 22010120344131.
It is a junction number, because it is equal to n+sod(n) for n = 13144302100983 and 13144302101001.
It is a congruent number.
It is an unprimeable number.
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, 57650447698 + ... + 57650447925.
It is an arithmetic number, because the mean of its divisors is an integer number (1729513434360).
Almost surely, 213144302101022 is an apocalyptic number.
13144302101022 is an abundant number, since it is smaller than the sum of its proper divisors (14527912848738).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13144302101022 is a wasteful number, since it uses less digits than its factorization.
13144302101022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115300895647.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 13144302101022 its reverse (22010120344131), we get a palindrome (35154422445153).
The spelling of 13144302101022 in words is "thirteen trillion, one hundred forty-four billion, three hundred two million, one hundred one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •