Base | Representation |
---|---|
bin | 100100001111001… |
… | …101111010111011 |
3 | 1120101000000121201 |
4 | 210033031322323 |
5 | 2221120001310 |
6 | 140154515031 |
7 | 21031436146 |
oct | 4417157273 |
9 | 1511000551 |
10 | 607968955 |
11 | 292201090 |
12 | 14b735a77 |
13 | 98c58b59 |
14 | 5aa5d05d |
15 | 38593e3a |
hex | 243cdebb |
607968955 has 8 divisors (see below), whose sum is σ = 795886704. Its totient is φ = 442159200.
The previous prime is 607968919. The next prime is 607968961. The reversal of 607968955 is 559869706.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 607968955 - 213 = 607960763 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (55), and also a Moran number because the ratio is a prime number: 11053981 = 607968955 / (6 + 0 + 7 + 9 + 6 + 8 + 9 + 5 + 5).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 607968896 and 607968905.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5526936 + ... + 5527045.
It is an arithmetic number, because the mean of its divisors is an integer number (99485838).
Almost surely, 2607968955 is an apocalyptic number.
607968955 is a deficient number, since it is larger than the sum of its proper divisors (187917749).
607968955 is a wasteful number, since it uses less digits than its factorization.
607968955 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11053997.
The product of its (nonzero) digits is 4082400, while the sum is 55.
The square root of 607968955 is about 24657.0264833374. The cubic root of 607968955 is about 847.1502976206.
It can be divided in two parts, 60796 and 8955, that added together give a triangular number (69751 = T373).
The spelling of 607968955 in words is "six hundred seven million, nine hundred sixty-eight thousand, nine hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •