Base | Representation |
---|---|
bin | 1000011110011010100… |
… | …1101001111011111111 |
3 | 111220211100212021000122 |
4 | 2013212221221323333 |
5 | 4341144010201002 |
6 | 150520034245155 |
7 | 13343123115626 |
oct | 2074651517377 |
9 | 456740767018 |
10 | 145603600127 |
11 | 56828488927 |
12 | 242764267bb |
13 | 109657aa00b |
14 | 70939326bd |
15 | 3bc2b576a2 |
hex | 21e6a69eff |
145603600127 has 4 divisors (see below), whose sum is σ = 145907574720. Its totient is φ = 145299625536.
The previous prime is 145603600097. The next prime is 145603600147. The reversal of 145603600127 is 721006306541.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 721006306541 = 593 ⋅1215862237.
It is a cyclic number.
It is not a de Polignac number, because 145603600127 - 220 = 145602551551 is a prime.
It is a super-2 number, since 2×1456036001272 (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 (145603600147) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 151986578 + ... + 151987535.
It is an arithmetic number, because the mean of its divisors is an integer number (36476893680).
Almost surely, 2145603600127 is an apocalyptic number.
145603600127 is a deficient number, since it is larger than the sum of its proper divisors (303974593).
145603600127 is an equidigital number, since it uses as much as digits as its factorization.
145603600127 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 303974592.
The product of its (nonzero) digits is 30240, while the sum is 35.
Adding to 145603600127 its reverse (721006306541), we get a palindrome (866609906668).
The spelling of 145603600127 in words is "one hundred forty-five billion, six hundred three million, six hundred thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •