Base | Representation |
---|---|
bin | 1000011011110101011… |
… | …1000110010111010111 |
3 | 111212001002100220220100 |
4 | 2012331113012113113 |
5 | 4333234140314400 |
6 | 150323210505143 |
7 | 13320012033324 |
oct | 2067527062727 |
9 | 455032326810 |
10 | 144910869975 |
11 | 56502454473 |
12 | 241024351b3 |
13 | 10885114911 |
14 | 702992bb4b |
15 | 3b81e1e100 |
hex | 21bd5c65d7 |
144910869975 has 18 divisors (see below), whose sum is σ = 259551469736. Its totient is φ = 77285797200.
The previous prime is 144910869973. The next prime is 144910869977. The reversal of 144910869975 is 579968019441.
144910869975 is a `hidden beast` number, since 14 + 491 + 0 + 8 + 69 + 9 + 75 = 666.
It is an interprime number because it is at equal distance from previous prime (144910869973) and next prime (144910869977).
It is not a de Polignac number, because 144910869975 - 21 = 144910869973 is a prime.
It is a super-2 number, since 2×1449108699752 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144910869973) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 322023931 + ... + 322024380.
Almost surely, 2144910869975 is an apocalyptic number.
144910869975 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
144910869975 is a deficient number, since it is larger than the sum of its proper divisors (114640599761).
144910869975 is a wasteful number, since it uses less digits than its factorization.
144910869975 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 644048327 (or 644048319 counting only the distinct ones).
The product of its (nonzero) digits is 19595520, while the sum is 63.
The spelling of 144910869975 in words is "one hundred forty-four billion, nine hundred ten million, eight hundred sixty-nine thousand, nine hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •