Base | Representation |
---|---|
bin | 1000011100101000111… |
… | …0001010001010011011 |
3 | 111212121010100200001222 |
4 | 2013022032022022123 |
5 | 4334204404130133 |
6 | 150400435202255 |
7 | 13325242000403 |
oct | 2071216121233 |
9 | 455533320058 |
10 | 145126630043 |
11 | 5660322117a |
12 | 2416274638b |
13 | 108baa294b5 |
14 | 704a453803 |
15 | 3b95d3ce98 |
hex | 21ca38a29b |
145126630043 has 4 divisors (see below), whose sum is σ = 145878581688. Its totient is φ = 144374678400.
The previous prime is 145126629937. The next prime is 145126630111. The reversal of 145126630043 is 340036621541.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 340036621541 = 11251 ⋅30222791.
It is a cyclic number.
It is not a de Polignac number, because 145126630043 - 218 = 145126367899 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 145126629985 and 145126630012.
It is not an unprimeable number, because it can be changed into a prime (145126630343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 375975533 + ... + 375975918.
It is an arithmetic number, because the mean of its divisors is an integer number (36469645422).
Almost surely, 2145126630043 is an apocalyptic number.
145126630043 is a deficient number, since it is larger than the sum of its proper divisors (751951645).
145126630043 is an equidigital number, since it uses as much as digits as its factorization.
145126630043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 751951644.
The product of its (nonzero) digits is 51840, while the sum is 35.
The spelling of 145126630043 in words is "one hundred forty-five billion, one hundred twenty-six million, six hundred thirty thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •