Base | Representation |
---|---|
bin | 111111111100011… |
… | …1101000001010011 |
3 | 12112112101121212010 |
4 | 1333320331001103 |
5 | 13343240331220 |
6 | 552524234003 |
7 | 104112415545 |
oct | 17770750123 |
9 | 5475347763 |
10 | 2145636435 |
11 | a01179458 |
12 | 4ba69b903 |
13 | 2826a9077 |
14 | 164d69695 |
15 | c857e1e0 |
hex | 7fe3d053 |
2145636435 has 8 divisors (see below), whose sum is σ = 3433018320. Its totient is φ = 1144339424.
The previous prime is 2145636431. The next prime is 2145636473. The reversal of 2145636435 is 5346365412.
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 2145636435 - 22 = 2145636431 is a prime.
It is a super-2 number, since 2×21456364352 = 9207511422399018450, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2145636393 and 2145636402.
It is not an unprimeable number, because it can be changed into a prime (2145636431) 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 in 7 ways as a sum of consecutive naturals, for example, 71521200 + ... + 71521229.
It is an arithmetic number, because the mean of its divisors is an integer number (429127290).
Almost surely, 22145636435 is an apocalyptic number.
2145636435 is a deficient number, since it is larger than the sum of its proper divisors (1287381885).
2145636435 is a wasteful number, since it uses less digits than its factorization.
2145636435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143042437.
The product of its digits is 259200, while the sum is 39.
The square root of 2145636435 is about 46321.0150471684. The cubic root of 2145636435 is about 1289.7891278412.
The spelling of 2145636435 in words is "two billion, one hundred forty-five million, six hundred thirty-six thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •