Base | Representation |
---|---|
bin | 111010110111110… |
… | …0010100100110100 |
3 | 12002200001112210021 |
4 | 1311233202210310 |
5 | 13021200143120 |
6 | 524003334524 |
7 | 66644410636 |
oct | 16557424464 |
9 | 5080045707 |
10 | 1975396660 |
11 | 924072826 |
12 | 471681444 |
13 | 256341883 |
14 | 14a4d2a56 |
15 | b8652aaa |
hex | 75be2934 |
1975396660 has 24 divisors (see below), whose sum is σ = 4149837216. Its totient is φ = 789872160.
The previous prime is 1975396639. The next prime is 1975396669. The reversal of 1975396660 is 666935791.
It is a junction number, because it is equal to n+sod(n) for n = 1975396598 and 1975396607.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1975396669) 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, 43819 + ... + 76621.
It is an arithmetic number, because the mean of its divisors is an integer number (172909884).
Almost surely, 21975396660 is an apocalyptic number.
1975396660 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1975396660 is an abundant number, since it is smaller than the sum of its proper divisors (2174440556).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1975396660 is a wasteful number, since it uses less digits than its factorization.
1975396660 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35823 (or 35821 counting only the distinct ones).
The product of its (nonzero) digits is 1837080, while the sum is 52.
The square root of 1975396660 is about 44445.4346361918. The cubic root of 1975396660 is about 1254.7333412277.
The spelling of 1975396660 in words is "one billion, nine hundred seventy-five million, three hundred ninety-six thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •