Base | Representation |
---|---|
bin | 110000111010100101… |
… | …0111011001000110011 |
3 | 101001010202201120002122 |
4 | 1201311022323020303 |
5 | 3210113010404133 |
6 | 120131303104455 |
7 | 10406053610225 |
oct | 1416512731063 |
9 | 331122646078 |
10 | 105045013043 |
11 | 40605198073 |
12 | 1843744212b |
13 | 9ba0a9b869 |
14 | 51270bc415 |
15 | 2aec0d3498 |
hex | 18752bb233 |
105045013043 has 4 divisors (see below), whose sum is σ = 110573697960. Its totient is φ = 99516328128.
The previous prime is 105045013033. The next prime is 105045013067. The reversal of 105045013043 is 340310540501.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 105045013043 - 24 = 105045013027 is a prime.
It is a super-3 number, since 3×1050450130433 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105045013033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2764342430 + ... + 2764342467.
It is an arithmetic number, because the mean of its divisors is an integer number (27643424490).
Almost surely, 2105045013043 is an apocalyptic number.
105045013043 is a deficient number, since it is larger than the sum of its proper divisors (5528684917).
105045013043 is an equidigital number, since it uses as much as digits as its factorization.
105045013043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5528684916.
The product of its (nonzero) digits is 3600, while the sum is 26.
Adding to 105045013043 its reverse (340310540501), we get a palindrome (445355553544).
The spelling of 105045013043 in words is "one hundred five billion, forty-five million, thirteen thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •