Base | Representation |
---|---|
bin | 100000110110010000111100… |
… | …011000100100011111010011 |
3 | 200221111212101002011100021202 |
4 | 200312100330120210133103 |
5 | 122413414424424322011 |
6 | 1231131001543141415 |
7 | 42300235235522036 |
oct | 4066207430443723 |
9 | 627455332140252 |
10 | 144466533042131 |
11 | 42038a04738543 |
12 | 142526b974486b |
13 | 627c19bc24041 |
14 | 2796308ba901d |
15 | 11a7d8ce1e23b |
hex | 83643c6247d3 |
144466533042131 has 8 divisors (see below), whose sum is σ = 147560676352320. Its totient is φ = 141373239202368.
The previous prime is 144466533042107. The next prime is 144466533042163. The reversal of 144466533042131 is 131240335664441.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-144466533042131 is a prime.
It is a super-2 number, since 2×1444665330421312 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (47).
It is not an unprimeable number, because it can be changed into a prime (144466533042101) 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, 212023826 + ... + 212704103.
It is an arithmetic number, because the mean of its divisors is an integer number (18445084544040).
Almost surely, 2144466533042131 is an apocalyptic number.
144466533042131 is a deficient number, since it is larger than the sum of its proper divisors (3094143310189).
144466533042131 is an equidigital number, since it uses as much as digits as its factorization.
144466533042131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 424735213.
The product of its (nonzero) digits is 2488320, while the sum is 47.
The spelling of 144466533042131 in words is "one hundred forty-four trillion, four hundred sixty-six billion, five hundred thirty-three million, forty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •