Base | Representation |
---|---|
bin | 111010101100000… |
… | …1001110111011100 |
3 | 12002020112002021222 |
4 | 1311120021313130 |
5 | 13013113004030 |
6 | 523224112512 |
7 | 66541325462 |
oct | 16530116734 |
9 | 5066462258 |
10 | 1969266140 |
11 | 920665886 |
12 | 46b605738 |
13 | 254ca634a |
14 | 149778832 |
15 | b7d413e5 |
hex | 75609ddc |
1969266140 has 12 divisors (see below), whose sum is σ = 4135458936. Its totient is φ = 787706448.
The previous prime is 1969266127. The next prime is 1969266149. The reversal of 1969266140 is 416629691.
It is a junction number, because it is equal to n+sod(n) for n = 1969266091 and 1969266100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1969266149) 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 3 ways as a sum of consecutive naturals, for example, 49231634 + ... + 49231673.
It is an arithmetic number, because the mean of its divisors is an integer number (344621578).
Almost surely, 21969266140 is an apocalyptic number.
1969266140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1969266140 is an abundant number, since it is smaller than the sum of its proper divisors (2166192796).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1969266140 is a wasteful number, since it uses less digits than its factorization.
1969266140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98463316 (or 98463314 counting only the distinct ones).
The product of its (nonzero) digits is 139968, while the sum is 44.
The square root of 1969266140 is about 44376.4142309854. The cubic root of 1969266140 is about 1253.4340006726.
The spelling of 1969266140 in words is "one billion, nine hundred sixty-nine million, two hundred sixty-six thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •