Base | Representation |
---|---|
bin | 111010101011010… |
… | …1111000000000011 |
3 | 12002012211011202100 |
4 | 1311112233000003 |
5 | 13013014101310 |
6 | 523212121443 |
7 | 66535215420 |
oct | 16526570003 |
9 | 5065734670 |
10 | 1968893955 |
11 | 920431196 |
12 | 46b466283 |
13 | 254ba5b12 |
14 | 1496bcd47 |
15 | b7cbaec0 |
hex | 755af003 |
1968893955 has 96 divisors (see below), whose sum is σ = 4210652160. Its totient is φ = 831156480.
The previous prime is 1968893951. The next prime is 1968893957. The reversal of 1968893955 is 5593988691.
It is not a de Polignac number, because 1968893955 - 22 = 1968893951 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a junction number, because it is equal to n+sod(n) for n = 1968893892 and 1968893901.
It is not an unprimeable number, because it can be changed into a prime (1968893951) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 205420 + ... + 214790.
It is an arithmetic number, because the mean of its divisors is an integer number (43860960).
Almost surely, 21968893955 is an apocalyptic number.
1968893955 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1968893955 is an abundant number, since it is smaller than the sum of its proper divisors (2241758205).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1968893955 is a wasteful number, since it uses less digits than its factorization.
1968893955 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9441 (or 9438 counting only the distinct ones).
The product of its digits is 20995200, while the sum is 63.
The square root of 1968893955 is about 44372.2205326711. The cubic root of 1968893955 is about 1253.3550306920.
The spelling of 1968893955 in words is "one billion, nine hundred sixty-eight million, eight hundred ninety-three thousand, nine hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •