Base | Representation |
---|---|
bin | 11110010001101101111… |
… | …11101101010110100101 |
3 | 10200110012121221011210201 |
4 | 33020312333231112211 |
5 | 114021021004144013 |
6 | 2113524233150501 |
7 | 135105502345456 |
oct | 17106677552645 |
9 | 3613177834721 |
10 | 1040304756133 |
11 | 371210a06805 |
12 | 14974bb5b431 |
13 | 7713c522976 |
14 | 384cb2a512d |
15 | 1c0d9d9b3dd |
hex | f236fed5a5 |
1040304756133 has 16 divisors (see below), whose sum is σ = 1089436182912. Its totient is φ = 991504800000.
The previous prime is 1040304756091. The next prime is 1040304756137. The reversal of 1040304756133 is 3316574030401.
It is a cyclic number.
It is not a de Polignac number, because 1040304756133 - 213 = 1040304747941 is a prime.
It is a super-2 number, since 2×10403047561332 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1040304756092 and 1040304756101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1040304756137) 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, 7129558 + ... + 7274008.
It is an arithmetic number, because the mean of its divisors is an integer number (68089761432).
Almost surely, 21040304756133 is an apocalyptic number.
It is an amenable number.
1040304756133 is a deficient number, since it is larger than the sum of its proper divisors (49131426779).
1040304756133 is a wasteful number, since it uses less digits than its factorization.
1040304756133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145596.
The product of its (nonzero) digits is 90720, while the sum is 37.
Adding to 1040304756133 its reverse (3316574030401), we get a palindrome (4356878786534).
The spelling of 1040304756133 in words is "one trillion, forty billion, three hundred four million, seven hundred fifty-six thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •