Base | Representation |
---|---|
bin | 1000011000111001001… |
… | …0101111111100101111 |
3 | 111210000001110112221012 |
4 | 2012032102233330233 |
5 | 4330130011403211 |
6 | 150113001255435 |
7 | 13261312663625 |
oct | 2061622577457 |
9 | 453001415835 |
10 | 144121200431 |
11 | 5613772a00a |
12 | 23b21a9457b |
13 | 1078a63ab30 |
14 | 6d92ad1515 |
15 | 3b37937d8b |
hex | 218e4aff2f |
144121200431 has 8 divisors (see below), whose sum is σ = 157523976624. Its totient is φ = 131049357120.
The previous prime is 144121200413. The next prime is 144121200437. The reversal of 144121200431 is 134002121441.
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 144121200431 - 26 = 144121200367 is a prime.
It is a super-2 number, since 2×1441212004312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 144121200397 and 144121200406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144121200437) 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, 82732310 + ... + 82734051.
It is an arithmetic number, because the mean of its divisors is an integer number (19690497078).
Almost surely, 2144121200431 is an apocalyptic number.
144121200431 is a deficient number, since it is larger than the sum of its proper divisors (13402776193).
144121200431 is a wasteful number, since it uses less digits than its factorization.
144121200431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 165466441.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 144121200431 its reverse (134002121441), we get a palindrome (278123321872).
The spelling of 144121200431 in words is "one hundred forty-four billion, one hundred twenty-one million, two hundred thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •