Base | Representation |
---|---|
bin | 111110101111101… |
… | …1110110000100011 |
3 | 12102201200121221122 |
4 | 1331133132300203 |
5 | 13302440420301 |
6 | 544530042455 |
7 | 103113433253 |
oct | 17537366043 |
9 | 5381617848 |
10 | 2105404451 |
11 | 99049a587 |
12 | 4a911942b |
13 | 277260a67 |
14 | 15d895963 |
15 | c4c8381b |
hex | 7d7dec23 |
2105404451 has 8 divisors (see below), whose sum is σ = 2165545824. Its totient is φ = 2045433600.
The previous prime is 2105404417. The next prime is 2105404471. The reversal of 2105404451 is 1544045012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2105404451 - 210 = 2105403427 is a prime.
It is a super-2 number, since 2×21054044512 = 8865455804581222802, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2105404451.
It is not an unprimeable number, because it can be changed into a prime (2105404471) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17375 + ... + 67176.
It is an arithmetic number, because the mean of its divisors is an integer number (270693228).
Almost surely, 22105404451 is an apocalyptic number.
2105404451 is a deficient number, since it is larger than the sum of its proper divisors (60141373).
2105404451 is an equidigital number, since it uses as much as digits as its factorization.
2105404451 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 85261.
The product of its (nonzero) digits is 3200, while the sum is 26.
The square root of 2105404451 is about 45884.6864541973. The cubic root of 2105404451 is about 1281.6767679709.
Adding to 2105404451 its reverse (1544045012), we get a palindrome (3649449463).
The spelling of 2105404451 in words is "two billion, one hundred five million, four hundred four thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •