Base | Representation |
---|---|
bin | 100000111000111000100110… |
… | …010110101000110101111011 |
3 | 200222011002000220201010202012 |
4 | 200320320212112220311323 |
5 | 122424342114312011410 |
6 | 1231345413023400135 |
7 | 42316240255123436 |
oct | 4070704626506573 |
9 | 628132026633665 |
10 | 144646552063355 |
11 | 420a8292791641 |
12 | 1428157975304b |
13 | 629315a798344 |
14 | 27a0d0531681d |
15 | 11ac8c7133605 |
hex | 838e265a8d7b |
144646552063355 has 4 divisors (see below), whose sum is σ = 173575862476032. Its totient is φ = 115717241650680.
The previous prime is 144646552063303. The next prime is 144646552063369. The reversal of 144646552063355 is 553360255646441.
144646552063355 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 144646552063355 - 212 = 144646552059259 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 144646552063294 and 144646552063303.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14464655206331 + ... + 14464655206340.
It is an arithmetic number, because the mean of its divisors is an integer number (43393965619008).
Almost surely, 2144646552063355 is an apocalyptic number.
144646552063355 is a deficient number, since it is larger than the sum of its proper divisors (28929310412677).
144646552063355 is an equidigital number, since it uses as much as digits as its factorization.
144646552063355 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28929310412676.
The product of its (nonzero) digits is 155520000, while the sum is 59.
The spelling of 144646552063355 in words is "one hundred forty-four trillion, six hundred forty-six billion, five hundred fifty-two million, sixty-three thousand, three hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •