Base | Representation |
---|---|
bin | 10001110000000100010… |
… | …010111000010110101101 |
3 | 11022121121221101021200210 |
4 | 101300010102320112231 |
5 | 124441214222122344 |
6 | 2332215452013033 |
7 | 154062561316320 |
oct | 21600422702655 |
9 | 4277557337623 |
10 | 1219842770349 |
11 | 430372496155 |
12 | 1784b6a61179 |
13 | 8b052531b38 |
14 | 4307d9a27b7 |
15 | 21ae6c49db9 |
hex | 11c044b85ad |
1219842770349 has 32 divisors (see below), whose sum is σ = 1961424256000. Its totient is φ = 658751336064.
The previous prime is 1219842770323. The next prime is 1219842770369. The reversal of 1219842770349 is 9430772489121.
It is not a de Polignac number, because 1219842770349 - 28 = 1219842770093 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1219842770369) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3574279 + ... + 3900660.
It is an arithmetic number, because the mean of its divisors is an integer number (61294508000).
Almost surely, 21219842770349 is an apocalyptic number.
1219842770349 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
1219842770349 is a deficient number, since it is larger than the sum of its proper divisors (741581485651).
1219842770349 is a wasteful number, since it uses less digits than its factorization.
1219842770349 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7475377.
The product of its (nonzero) digits is 6096384, while the sum is 57.
The spelling of 1219842770349 in words is "one trillion, two hundred nineteen billion, eight hundred forty-two million, seven hundred seventy thousand, three hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •