Base | Representation |
---|---|
bin | 100000110001000110000010… |
… | …010100111111100111100110 |
3 | 200220020220020222221020211120 |
4 | 200301012002110333213212 |
5 | 122342104241400133410 |
6 | 1230255441002114410 |
7 | 42232456323432414 |
oct | 4061060224774746 |
9 | 626226228836746 |
10 | 144111224224230 |
11 | 41a1125511478a |
12 | 141b58794aba06 |
13 | 625482652c563 |
14 | 27830402482b4 |
15 | 119d9e4cb2570 |
hex | 83118253f9e6 |
144111224224230 has 32 divisors (see below), whose sum is σ = 353225809165824. Its totient is φ = 37612007456736.
The previous prime is 144111224224199. The next prime is 144111224224271. The reversal of 144111224224230 is 32422422111441.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 144111224224191 and 144111224224200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 51103269592 + ... + 51103272411.
It is an arithmetic number, because the mean of its divisors is an integer number (11038306536432).
Almost surely, 2144111224224230 is an apocalyptic number.
144111224224230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
144111224224230 is an abundant number, since it is smaller than the sum of its proper divisors (209114584941594).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144111224224230 is a wasteful number, since it uses less digits than its factorization.
144111224224230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 102206542060.
The product of its (nonzero) digits is 24576, while the sum is 33.
Adding to 144111224224230 its reverse (32422422111441), we get a palindrome (176533646335671).
The spelling of 144111224224230 in words is "one hundred forty-four trillion, one hundred eleven billion, two hundred twenty-four million, two hundred twenty-four thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •