Base | Representation |
---|---|
bin | 11101101111000101111… |
… | …100110000000010001000 |
3 | 21020100110011222222021001 |
4 | 131233011330300002020 |
5 | 231434421202040121 |
6 | 4202423343224344 |
7 | 300430053454003 |
oct | 35570574600210 |
9 | 7210404888231 |
10 | 2043430502536 |
11 | 718683279195 |
12 | 2900448a80b4 |
13 | 11a90525c397 |
14 | 70c8c8c853a |
15 | 3824ac44991 |
hex | 1dbc5f30088 |
2043430502536 has 8 divisors (see below), whose sum is σ = 3831432192270. Its totient is φ = 1021715251264.
The previous prime is 2043430502497. The next prime is 2043430502537. The reversal of 2043430502536 is 6352050343402.
It can be written as a sum of positive squares in only one way, i.e., 1987169508900 + 56260993636 = 1409670^2 + 237194^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a junction number, because it is equal to n+sod(n) for n = 2043430502495 and 2043430502504.
It is not an unprimeable number, because it can be changed into a prime (2043430502537) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 127714406401 + ... + 127714406416.
Almost surely, 22043430502536 is an apocalyptic number.
It is an amenable number.
2043430502536 is a deficient number, since it is larger than the sum of its proper divisors (1788001689734).
2043430502536 is a wasteful number, since it uses less digits than its factorization.
2043430502536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 255428812823 (or 255428812819 counting only the distinct ones).
The product of its (nonzero) digits is 259200, while the sum is 37.
Adding to 2043430502536 its reverse (6352050343402), we get a palindrome (8395480845938).
The spelling of 2043430502536 in words is "two trillion, forty-three billion, four hundred thirty million, five hundred two thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •