Base | Representation |
---|---|
bin | 10001001111110… |
… | …10011001010010 |
3 | 101002020112101011 |
4 | 20213322121102 |
5 | 244014234110 |
6 | 22205001134 |
7 | 3404523061 |
oct | 1047723122 |
9 | 332215334 |
10 | 144680530 |
11 | 74739695 |
12 | 405531aa |
13 | 23c888a7 |
14 | 153021d8 |
15 | ca7d48a |
hex | 89fa652 |
144680530 has 8 divisors (see below), whose sum is σ = 260424972. Its totient is φ = 57872208.
The previous prime is 144680527. The next prime is 144680531. The reversal of 144680530 is 35086441.
It is a happy number.
144680530 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 123676641 + 21003889 = 11121^2 + 4583^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1446805302 = 41864911522161800, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 144680492 and 144680501.
It is not an unprimeable number, because it can be changed into a prime (144680531) 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, 7234017 + ... + 7234036.
Almost surely, 2144680530 is an apocalyptic number.
144680530 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
144680530 is a deficient number, since it is larger than the sum of its proper divisors (115744442).
144680530 is a wasteful number, since it uses less digits than its factorization.
144680530 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14468060.
The product of its (nonzero) digits is 11520, while the sum is 31.
The square root of 144680530 is about 12028.3219943598. The cubic root of 144680530 is about 524.9726728028.
The spelling of 144680530 in words is "one hundred forty-four million, six hundred eighty thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •