Base | Representation |
---|---|
bin | 110000111010011101… |
… | …1100111111111010101 |
3 | 101001010111011210121021 |
4 | 1201310323213333111 |
5 | 3210110444034303 |
6 | 120131041121141 |
7 | 10406004534442 |
oct | 1416473477725 |
9 | 331114153537 |
10 | 105041002453 |
11 | 406029a8932 |
12 | 184360291b1 |
13 | 9b9ccc622a |
14 | 51267569c9 |
15 | 2aeba8eebd |
hex | 1874ee7fd5 |
105041002453 has 4 divisors (see below), whose sum is σ = 105044768800. Its totient is φ = 105037236108.
The previous prime is 105041002421. The next prime is 105041002477. The reversal of 105041002453 is 354200140501.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 105041002453 - 25 = 105041002421 is a prime.
It is a super-2 number, since 2×1050410024532 (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 (105041002853) 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, 1841025 + ... + 1897222.
It is an arithmetic number, because the mean of its divisors is an integer number (26261192200).
Almost surely, 2105041002453 is an apocalyptic number.
It is an amenable number.
105041002453 is a deficient number, since it is larger than the sum of its proper divisors (3766347).
105041002453 is an equidigital number, since it uses as much as digits as its factorization.
105041002453 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3766346.
The product of its (nonzero) digits is 2400, while the sum is 25.
Adding to 105041002453 its reverse (354200140501), we get a palindrome (459241142954).
The spelling of 105041002453 in words is "one hundred five billion, forty-one million, two thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •