Base | Representation |
---|---|
bin | 1000011011111000010… |
… | …0000100000001010111 |
3 | 111212001220112202110110 |
4 | 2012332010010001113 |
5 | 4333300200004410 |
6 | 150324311254103 |
7 | 13320214154364 |
oct | 2067604040127 |
9 | 455056482413 |
10 | 144922656855 |
11 | 56509075099 |
12 | 2410637a333 |
13 | 108876b08c2 |
14 | 702b31946b |
15 | 3b82e9b720 |
hex | 21be104057 |
144922656855 has 32 divisors (see below), whose sum is σ = 240947804160. Its totient is φ = 74292140160.
The previous prime is 144922656847. The next prime is 144922656859. The reversal of 144922656855 is 558656229441.
It is not a de Polignac number, because 144922656855 - 23 = 144922656847 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 144922656795 and 144922656804.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144922656859) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 649981 + ... + 843990.
It is an arithmetic number, because the mean of its divisors is an integer number (7529618880).
Almost surely, 2144922656855 is an apocalyptic number.
144922656855 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
144922656855 is a deficient number, since it is larger than the sum of its proper divisors (96025147305).
144922656855 is a wasteful number, since it uses less digits than its factorization.
144922656855 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1494231.
The product of its digits is 20736000, while the sum is 57.
The spelling of 144922656855 in words is "one hundred forty-four billion, nine hundred twenty-two million, six hundred fifty-six thousand, eight hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •