Base | Representation |
---|---|
bin | 100100001011011… |
… | …1110010111011001 |
3 | 10010121022200110120 |
4 | 1020112332113121 |
5 | 4441234412134 |
6 | 320243503453 |
7 | 42040451421 |
oct | 11026762731 |
9 | 3117280416 |
10 | 1213982169 |
11 | 573296854 |
12 | 29a687b89 |
13 | 16467b75a |
14 | b732d481 |
15 | 7189d649 |
hex | 485be5d9 |
1213982169 has 8 divisors (see below), whose sum is σ = 1624616832. Its totient is φ = 806334480.
The previous prime is 1213982141. The next prime is 1213982213. The reversal of 1213982169 is 9612893121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1213982169 - 28 = 1213981913 is a prime.
It is a super-2 number, since 2×12139821692 = 2947505413299889122, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1213982169.
It is not an unprimeable number, because it can be changed into a prime (1213984169) 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 7 ways as a sum of consecutive naturals, for example, 745794 + ... + 747419.
It is an arithmetic number, because the mean of its divisors is an integer number (203077104).
Almost surely, 21213982169 is an apocalyptic number.
It is an amenable number.
1213982169 is a deficient number, since it is larger than the sum of its proper divisors (410634663).
1213982169 is a wasteful number, since it uses less digits than its factorization.
1213982169 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1493487.
The product of its digits is 46656, while the sum is 42.
The square root of 1213982169 is about 34842.2468994180. The cubic root of 1213982169 is about 1066.7699396863.
The spelling of 1213982169 in words is "one billion, two hundred thirteen million, nine hundred eighty-two thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •