Base | Representation |
---|---|
bin | 1000011010010100100… |
… | …1000000001101000111 |
3 | 111210222202202021122102 |
4 | 2012211021000031013 |
5 | 4331421124142133 |
6 | 150215013222315 |
7 | 13303646111114 |
oct | 2064511001507 |
9 | 453882667572 |
10 | 144504521543 |
11 | 56314042918 |
12 | 2400a33199b |
13 | 1081bb8c865 |
14 | 6dcb99390b |
15 | 3b5b4047e8 |
hex | 21a5240347 |
144504521543 has 4 divisors (see below), whose sum is σ = 144572976768. Its totient is φ = 144436066320.
The previous prime is 144504521479. The next prime is 144504521587. The reversal of 144504521543 is 345125405441.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 144504521543 - 26 = 144504521479 is a prime.
It is a super-2 number, since 2×1445045215432 (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 = 144504521497 and 144504521506.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144504521593) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 34224446 + ... + 34228667.
It is an arithmetic number, because the mean of its divisors is an integer number (36143244192).
Almost surely, 2144504521543 is an apocalyptic number.
144504521543 is a deficient number, since it is larger than the sum of its proper divisors (68455225).
144504521543 is an equidigital number, since it uses as much as digits as its factorization.
144504521543 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 68455224.
The product of its (nonzero) digits is 192000, while the sum is 38.
Adding to 144504521543 its reverse (345125405441), we get a palindrome (489629926984).
The spelling of 144504521543 in words is "one hundred forty-four billion, five hundred four million, five hundred twenty-one thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •