Base | Representation |
---|---|
bin | 111001110001000… |
… | …000101000100010 |
3 | 2111112121212110000 |
4 | 321301000220202 |
5 | 3441100231322 |
6 | 240100120430 |
7 | 33005426115 |
oct | 7161005042 |
9 | 2445555400 |
10 | 969148962 |
11 | 458071a61 |
12 | 230696116 |
13 | 125a27a32 |
14 | 929da57c |
15 | 5a13a3ac |
hex | 39c40a22 |
969148962 has 20 divisors (see below), whose sum is σ = 2171611926. Its totient is φ = 323049600.
The previous prime is 969148931. The next prime is 969148963. The reversal of 969148962 is 269841969.
It can be written as a sum of positive squares in only one way, i.e., 969139161 + 9801 = 31131^2 + 99^2 .
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a junction number, because it is equal to n+sod(n) for n = 969148899 and 969148908.
It is not an unprimeable number, because it can be changed into a prime (969148963) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 2991039 + ... + 2991362.
Almost surely, 2969148962 is an apocalyptic number.
969148962 is an abundant number, since it is smaller than the sum of its proper divisors (1202462964).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
969148962 is a wasteful number, since it uses less digits than its factorization.
969148962 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5982415 (or 5982406 counting only the distinct ones).
The product of its digits is 1679616, while the sum is 54.
The square root of 969148962 is about 31131.1574150400. The cubic root of 969148962 is about 989.6087158940.
It can be divided in two parts, 9691 and 48962, that added together give a triangular number (58653 = T342).
The spelling of 969148962 in words is "nine hundred sixty-nine million, one hundred forty-eight thousand, nine hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •