Base | Representation |
---|---|
bin | 100000110100010010001010… |
… | …111100011011100101100110 |
3 | 200221000212000120121122100111 |
4 | 200310102022330123211212 |
5 | 122404202141000042410 |
6 | 1230544250451203234 |
7 | 42254346105643021 |
oct | 4064221274334546 |
9 | 627025016548314 |
10 | 144330412112230 |
11 | 41a96202a51163 |
12 | 1423024aba651a |
13 | 626c3b7bc24c6 |
14 | 278d8b48121b8 |
15 | 11a4572a36b8a |
hex | 83448af1b966 |
144330412112230 has 32 divisors (see below), whose sum is σ = 261429686870400. Its totient is φ = 57369963356160.
The previous prime is 144330412112111. The next prime is 144330412112279. The reversal of 144330412112230 is 32211214033441.
It is a happy number.
It is a super-2 number, since 2×1443304121122302 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 144330412112192 and 144330412112201.
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, 68945755 + ... + 71008294.
It is an arithmetic number, because the mean of its divisors is an integer number (8169677714700).
Almost surely, 2144330412112230 is an apocalyptic number.
144330412112230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
144330412112230 is a deficient number, since it is larger than the sum of its proper divisors (117099274758170).
144330412112230 is a wasteful number, since it uses less digits than its factorization.
144330412112230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 139954704.
The product of its (nonzero) digits is 13824, while the sum is 31.
Adding to 144330412112230 its reverse (32211214033441), we get a palindrome (176541626145671).
The spelling of 144330412112230 in words is "one hundred forty-four trillion, three hundred thirty billion, four hundred twelve million, one hundred twelve thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •