Base | Representation |
---|---|
bin | 11101110101011001000110… |
… | …111111110000111100000011 |
3 | 122012120210020200120011112222 |
4 | 131311121012333300330003 |
5 | 114144241040123412233 |
6 | 1143022055210041255 |
7 | 36431533426605260 |
oct | 3565310677607403 |
9 | 565523220504488 |
10 | 131212442013443 |
11 | 3889897a8a715a |
12 | 12871a2541922b |
13 | 582a38476610b |
14 | 2458a04cc4267 |
15 | 102820b716898 |
hex | 775646ff0f03 |
131212442013443 has 8 divisors (see below), whose sum is σ = 150445536122112. Its totient is φ = 112101462788616.
The previous prime is 131212442013329. The next prime is 131212442013461. The reversal of 131212442013443 is 344310244212131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 131212442013443 - 240 = 130112930385667 is a prime.
It is a super-2 number, since 2×1312124420134432 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (131212442013143) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 30528718655 + ... + 30528722952.
It is an arithmetic number, because the mean of its divisors is an integer number (18805692015264).
Almost surely, 2131212442013443 is an apocalyptic number.
131212442013443 is a deficient number, since it is larger than the sum of its proper divisors (19233094108669).
131212442013443 is an equidigital number, since it uses as much as digits as its factorization.
131212442013443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61057441921.
The product of its (nonzero) digits is 55296, while the sum is 35.
Adding to 131212442013443 its reverse (344310244212131), we get a palindrome (475522686225574).
The spelling of 131212442013443 in words is "one hundred thirty-one trillion, two hundred twelve billion, four hundred forty-two million, thirteen thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •