Base | Representation |
---|---|
bin | 10110011000110010110… |
… | …011100100010000111010 |
3 | 12110002000021100120220112 |
4 | 112120302303210100322 |
5 | 200201221332430100 |
6 | 3134430545024322 |
7 | 216102145636115 |
oct | 26306263442072 |
9 | 5402007316815 |
10 | 1538450670650 |
11 | 5434a9329353 |
12 | 20a1b40250a2 |
13 | b20c94c482a |
14 | 5466617357c |
15 | 2a042d40b35 |
hex | 16632ce443a |
1538450670650 has 12 divisors (see below), whose sum is σ = 2861518247502. Its totient is φ = 615380268240.
The previous prime is 1538450670529. The next prime is 1538450670697. The reversal of 1538450670650 is 560760548351.
It can be written as a sum of positive squares in 3 ways, for example, as 828123660169 + 710327010481 = 910013^2 + 842809^2 .
It is a Harshad number since it is a multiple of its sum of digits (50), and also a Moran number because the ratio is a prime number: 30769013413 = 1538450670650 / (1 + 5 + 3 + 8 + 4 + 5 + 0 + 6 + 7 + 0 + 6 + 5 + 0).
It is an unprimeable number.
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 5 ways as a sum of consecutive naturals, for example, 15384506657 + ... + 15384506756.
Almost surely, 21538450670650 is an apocalyptic number.
1538450670650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1538450670650 is a deficient number, since it is larger than the sum of its proper divisors (1323067576852).
1538450670650 is a wasteful number, since it uses less digits than its factorization.
1538450670650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30769013425 (or 30769013420 counting only the distinct ones).
The product of its (nonzero) digits is 3024000, while the sum is 50.
The spelling of 1538450670650 in words is "one trillion, five hundred thirty-eight billion, four hundred fifty million, six hundred seventy thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •