Base | Representation |
---|---|
bin | 1000001000110… |
… | …11000110110001 |
3 | 11202110101201200 |
4 | 10010123012301 |
5 | 114434042330 |
6 | 10435121413 |
7 | 1456162266 |
oct | 404330661 |
9 | 152411650 |
10 | 68268465 |
11 | 35599121 |
12 | 1aa43269 |
13 | 111b3655 |
14 | 90d126d |
15 | 5ed7a60 |
hex | 411b1b1 |
68268465 has 24 divisors (see below), whose sum is σ = 122414760. Its totient is φ = 35153664.
The previous prime is 68268457. The next prime is 68268493. The reversal of 68268465 is 56486286.
It can be written as a sum of positive squares in 4 ways, for example, as 22014864 + 46253601 = 4692^2 + 6801^2 .
It is not a de Polignac number, because 68268465 - 23 = 68268457 is a prime.
It is a super-3 number, since 3×682684653 (a number of 24 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 68268465.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 24852 + ... + 27461.
It is an arithmetic number, because the mean of its divisors is an integer number (5100615).
Almost surely, 268268465 is an apocalyptic number.
It is an amenable number.
68268465 is a deficient number, since it is larger than the sum of its proper divisors (54146295).
68268465 is a wasteful number, since it uses less digits than its factorization.
68268465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52353 (or 52350 counting only the distinct ones).
The product of its digits is 552960, while the sum is 45.
The square root of 68268465 is about 8262.4732979901. The cubic root of 68268465 is about 408.7019526612.
The spelling of 68268465 in words is "sixty-eight million, two hundred sixty-eight thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •