Base | Representation |
---|---|
bin | 11110010010001001011… |
… | …00001110110111101101 |
3 | 10200110210122021222102220 |
4 | 33021010230032313231 |
5 | 114022003320002230 |
6 | 2114003122105553 |
7 | 135114262404624 |
oct | 17110454166755 |
9 | 3613718258386 |
10 | 1040534531565 |
11 | 371319686461 |
12 | 1497b4aab2b9 |
13 | 77178003969 |
14 | 3850d9d86bb |
15 | 1c100137d10 |
hex | f244b0eded |
1040534531565 has 16 divisors (see below), whose sum is σ = 1670278239168. Its totient is φ = 553144087296.
The previous prime is 1040534531563. The next prime is 1040534531573. The reversal of 1040534531565 is 5651354350401.
It is a happy number.
It is not a de Polignac number, because 1040534531565 - 21 = 1040534531563 is a prime.
It is a super-2 number, since 2×10405345315652 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1040534531563) 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, 112974172 + ... + 112983381.
It is an arithmetic number, because the mean of its divisors is an integer number (104392389948).
Almost surely, 21040534531565 is an apocalyptic number.
1040534531565 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1040534531565 is a deficient number, since it is larger than the sum of its proper divisors (629743707603).
1040534531565 is a wasteful number, since it uses less digits than its factorization.
1040534531565 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 225957868.
The product of its (nonzero) digits is 540000, while the sum is 42.
Adding to 1040534531565 its reverse (5651354350401), we get a palindrome (6691888881966).
The spelling of 1040534531565 in words is "one trillion, forty billion, five hundred thirty-four million, five hundred thirty-one thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.141 sec. • engine limits •