Base | Representation |
---|---|
bin | 1000011000101000100… |
… | …0111010001101010001 |
3 | 111202211012100000120120 |
4 | 2012022020322031101 |
5 | 4330004141342040 |
6 | 150102031500453 |
7 | 13256505436032 |
oct | 2061210721521 |
9 | 452735300516 |
10 | 144051512145 |
11 | 56101361192 |
12 | 23b02687729 |
13 | 1077907b168 |
14 | 6d87750a89 |
15 | 3b3176e7d0 |
hex | 218a23a351 |
144051512145 has 16 divisors (see below), whose sum is σ = 230501081472. Its totient is φ = 76821252480.
The previous prime is 144051512119. The next prime is 144051512147. The reversal of 144051512145 is 541215150441.
It is not a de Polignac number, because 144051512145 - 26 = 144051512081 is a prime.
It is a super-2 number, since 2×1440515121452 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (144051512147) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 194221 + ... + 570810.
It is an arithmetic number, because the mean of its divisors is an integer number (14406317592).
Almost surely, 2144051512145 is an apocalyptic number.
144051512145 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
144051512145 is a deficient number, since it is larger than the sum of its proper divisors (86449569327).
144051512145 is a wasteful number, since it uses less digits than its factorization.
144051512145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 777592.
The product of its (nonzero) digits is 16000, while the sum is 33.
Adding to 144051512145 its reverse (541215150441), we get a palindrome (685266662586).
It can be divided in two parts, 1440515 and 12145, that added together give a triangular number (1452660 = T1704).
The spelling of 144051512145 in words is "one hundred forty-four billion, fifty-one million, five hundred twelve thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •