Base | Representation |
---|---|
bin | 1000011010010110011… |
… | …1000011110000110001 |
3 | 111211000022120120110011 |
4 | 2012211213003300301 |
5 | 4331430133303213 |
6 | 150215454134521 |
7 | 13304103064462 |
oct | 2064547036061 |
9 | 454008516404 |
10 | 144512400433 |
11 | 563185343a5 |
12 | 24010ab1441 |
13 | 108206bab1b |
14 | 6dcca44d69 |
15 | 3b5be5e03d |
hex | 21a59c3c31 |
144512400433 has 8 divisors (see below), whose sum is σ = 147406347200. Its totient is φ = 141640131600.
The previous prime is 144512400427. The next prime is 144512400437. The reversal of 144512400433 is 334004215441.
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 144512400433 - 25 = 144512400401 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 144512400395 and 144512400404.
It is not an unprimeable number, because it can be changed into a prime (144512400437) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5406018 + ... + 5432683.
It is an arithmetic number, because the mean of its divisors is an integer number (18425793400).
Almost surely, 2144512400433 is an apocalyptic number.
It is an amenable number.
144512400433 is a deficient number, since it is larger than the sum of its proper divisors (2893946767).
144512400433 is a wasteful number, since it uses less digits than its factorization.
144512400433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10838967.
The product of its (nonzero) digits is 23040, while the sum is 31.
Adding to 144512400433 its reverse (334004215441), we get a palindrome (478516615874).
The spelling of 144512400433 in words is "one hundred forty-four billion, five hundred twelve million, four hundred thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •