Base | Representation |
---|---|
bin | 100000110100000000011000… |
… | …000000111000110001011011 |
3 | 200220222000200220101120002020 |
4 | 200310000120000320301123 |
5 | 122403344022313000243 |
6 | 1230531410422505523 |
7 | 42253101433640232 |
oct | 4064003000706133 |
9 | 626860626346066 |
10 | 144311304031323 |
11 | 41a89097a35160 |
12 | 142285b78952a3 |
13 | 626a661242060 |
14 | 278c9c0b81b19 |
15 | 11a3d0524d283 |
hex | 834018038c5b |
144311304031323 has 128 divisors (see below), whose sum is σ = 245242290069504. Its totient is φ = 74215451059200.
The previous prime is 144311304031313. The next prime is 144311304031327. The reversal of 144311304031323 is 323130403113441.
It is not a de Polignac number, because 144311304031323 - 26 = 144311304031259 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (144311304031327) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 24442536 + ... + 29766762.
It is an arithmetic number, because the mean of its divisors is an integer number (1915955391168).
Almost surely, 2144311304031323 is an apocalyptic number.
144311304031323 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
144311304031323 is a deficient number, since it is larger than the sum of its proper divisors (100930986038181).
144311304031323 is a wasteful number, since it uses less digits than its factorization.
144311304031323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5324385.
The product of its (nonzero) digits is 31104, while the sum is 33.
Adding to 144311304031323 its reverse (323130403113441), we get a palindrome (467441707144764).
The spelling of 144311304031323 in words is "one hundred forty-four trillion, three hundred eleven billion, three hundred four million, thirty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •