Base | Representation |
---|---|
bin | 100000110101110011111001… |
… | …001001101111011000100011 |
3 | 200221101212212012112101002102 |
4 | 200311303321021233120203 |
5 | 122412412034104410201 |
6 | 1231104402422441015 |
7 | 42265052243625140 |
oct | 4065637111573043 |
9 | 627355765471072 |
10 | 144435340310051 |
11 | 4202675820221a |
12 | 1424865329316b |
13 | 627926a71091b |
14 | 27949ca1a33c7 |
15 | 11a716474326b |
hex | 835cf926f623 |
144435340310051 has 8 divisors (see below), whose sum is σ = 165071951121504. Its totient is φ = 123799477190400.
The previous prime is 144435340310021. The next prime is 144435340310083. The reversal of 144435340310051 is 150013043534441.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 144435340310051 - 218 = 144435340047907 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 144435340309987 and 144435340310014.
It is not an unprimeable number, because it can be changed into a prime (144435340310021) 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, 186508940 + ... + 187281753.
It is an arithmetic number, because the mean of its divisors is an integer number (20633993890188).
Almost surely, 2144435340310051 is an apocalyptic number.
144435340310051 is a deficient number, since it is larger than the sum of its proper divisors (20636610811453).
144435340310051 is an equidigital number, since it uses as much as digits as its factorization.
144435340310051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 373845901.
The product of its (nonzero) digits is 172800, while the sum is 38.
Adding to 144435340310051 its reverse (150013043534441), we get a palindrome (294448383844492).
The spelling of 144435340310051 in words is "one hundred forty-four trillion, four hundred thirty-five billion, three hundred forty million, three hundred ten thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •