Base | Representation |
---|---|
bin | 111101111111111… |
… | …011001000011101 |
3 | 2200111020222111111 |
4 | 331333323020131 |
5 | 4112240324303 |
6 | 251114222021 |
7 | 34530164113 |
oct | 7577731035 |
9 | 2614228444 |
10 | 1040167453 |
11 | 494169226 |
12 | 250424911 |
13 | 137662000 |
14 | 9c205ab3 |
15 | 614b7b6d |
hex | 3dffb21d |
1040167453 has 16 divisors (see below), whose sum is σ = 1148197680. Its totient is φ = 941932992.
The previous prime is 1040167451. The next prime is 1040167487. The reversal of 1040167453 is 3547610401.
It can be written as a sum of positive squares in 8 ways, for example, as 728892004 + 311275449 = 26998^2 + 17643^2 .
It is not a de Polignac number, because 1040167453 - 21 = 1040167451 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1040167451) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 111975 + ... + 120907.
It is an arithmetic number, because the mean of its divisors is an integer number (71762355).
Almost surely, 21040167453 is an apocalyptic number.
1040167453 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1040167453 is a deficient number, since it is larger than the sum of its proper divisors (108030227).
1040167453 is an frugal number, since it uses more digits than its factorization.
1040167453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9025 (or 8999 counting only the distinct ones).
The product of its (nonzero) digits is 10080, while the sum is 31.
The square root of 1040167453 is about 32251.6271372469. The cubic root of 1040167453 is about 1013.2137780115.
Adding to 1040167453 its reverse (3547610401), we get a palindrome (4587777854).
The spelling of 1040167453 in words is "one billion, forty million, one hundred sixty-seven thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •