Base | Representation |
---|---|
bin | 1000011110100011110… |
… | …0100011110110011001 |
3 | 111220221001022210010121 |
4 | 2013220330203312121 |
5 | 4341233340012421 |
6 | 150523531513241 |
7 | 13344101340436 |
oct | 2075074436631 |
9 | 456831283117 |
10 | 145642110361 |
11 | 568481a1170 |
12 | 242872b8821 |
13 | 10970771737 |
14 | 7098ab8b8d |
15 | 3bc6212d41 |
hex | 21e8f23d99 |
145642110361 has 16 divisors (see below), whose sum is σ = 163194378048. Its totient is φ = 128809310400.
The previous prime is 145642110349. The next prime is 145642110379. The reversal of 145642110361 is 163011246541.
It is a cyclic number.
It is not a de Polignac number, because 145642110361 - 27 = 145642110233 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (145642110301) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5775366 + ... + 5800528.
It is an arithmetic number, because the mean of its divisors is an integer number (10199648628).
Almost surely, 2145642110361 is an apocalyptic number.
145642110361 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
145642110361 is a deficient number, since it is larger than the sum of its proper divisors (17552267687).
145642110361 is a wasteful number, since it uses less digits than its factorization.
145642110361 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39432.
The product of its (nonzero) digits is 17280, while the sum is 34.
The spelling of 145642110361 in words is "one hundred forty-five billion, six hundred forty-two million, one hundred ten thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •