Base | Representation |
---|---|
bin | 100000111101010111010000… |
… | …101010010000010101101001 |
3 | 201000020111112000121112121100 |
4 | 200331113100222100111221 |
5 | 122444413003103314401 |
6 | 1232143035432432013 |
7 | 42350414654402100 |
oct | 4075272052202551 |
9 | 630214460545540 |
10 | 144954352010601 |
11 | 42206882837731 |
12 | 1431115b248609 |
13 | 62b61a1564a43 |
14 | 27b1b84329037 |
15 | 11b58de472b86 |
hex | 83d5d0a90569 |
144954352010601 has 243 divisors, whose sum is σ = 254414485174941. Its totient is φ = 79296732412128.
The previous prime is 144954352010561. The next prime is 144954352010729. The reversal of 144954352010601 is 106010253459441.
The square root of 144954352010601 is 12039699.
It is a perfect power (a square), and thus also a powerful number.
144954352010601 is a `hidden beast` number, since 1 + 4 + 4 + 9 + 5 + 4 + 3 + 5 + 20 + 10 + 601 = 666.
It is not a de Polignac number, because 144954352010601 - 217 = 144954351879529 is a prime.
It is not an unprimeable number, because it can be changed into a prime (144954352010101) by changing a digit.
It is a polite number, since it can be written in 242 ways as a sum of consecutive naturals, for example, 728413829100 + ... + 728413829298.
Almost surely, 2144954352010601 is an apocalyptic number.
144954352010601 is the 12039699-th square number.
144954352010601 is the 6019850-th centered octagonal number.
It is an amenable number.
144954352010601 is a deficient number, since it is larger than the sum of its proper divisors (109460133164340).
144954352010601 is an frugal number, since it uses more digits than its factorization.
144954352010601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 638 (or 319 counting only the distinct ones).
The product of its (nonzero) digits is 518400, while the sum is 45.
The spelling of 144954352010601 in words is "one hundred forty-four trillion, nine hundred fifty-four billion, three hundred fifty-two million, ten thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •