Base | Representation |
---|---|
bin | 1000001000011… |
… | …01010111001010 |
3 | 11202100112111200 |
4 | 10010031113022 |
5 | 114430242140 |
6 | 10434005030 |
7 | 1455536205 |
oct | 404152712 |
9 | 152315450 |
10 | 68212170 |
11 | 3555a8a4 |
12 | 1aa16776 |
13 | 11193b40 |
14 | 90b893c |
15 | 5ec6030 |
hex | 410d5ca |
68212170 has 96 divisors (see below), whose sum is σ = 192668112. Its totient is φ = 16644096.
The previous prime is 68212103. The next prime is 68212171. The reversal of 68212170 is 7121286.
It can be written as a sum of positive squares in 8 ways, for example, as 24295041 + 43917129 = 4929^2 + 6627^2 .
It is a super-2 number, since 2×682121702 = 9305800272217800, which contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (68212171) 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 47 ways as a sum of consecutive naturals, for example, 202242 + ... + 202578.
Almost surely, 268212170 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 68212170, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (96334056).
68212170 is an abundant number, since it is smaller than the sum of its proper divisors (124455942).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68212170 is a wasteful number, since it uses less digits than its factorization.
68212170 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 536 (or 533 counting only the distinct ones).
The product of its (nonzero) digits is 1344, while the sum is 27.
The square root of 68212170 is about 8259.0659278153. The cubic root of 68212170 is about 408.5895815808.
The spelling of 68212170 in words is "sixty-eight million, two hundred twelve thousand, one hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •