Base | Representation |
---|---|
bin | 11001011110010… |
… | …11101110101110 |
3 | 112220002211222200 |
4 | 30233023232232 |
5 | 414201223111 |
6 | 33112122330 |
7 | 5203244451 |
oct | 1457135656 |
9 | 486084880 |
10 | 213695406 |
11 | aa697581 |
12 | 5b6963a6 |
13 | 35370bb2 |
14 | 20549498 |
15 | 13b62256 |
hex | cbcbbae |
213695406 has 48 divisors (see below), whose sum is σ = 492012144. Its totient is φ = 66799872.
The previous prime is 213695401. The next prime is 213695411. The reversal of 213695406 is 604596312.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (213695401) and next prime (213695411).
It is a zygodrome in base 3.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213695401) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 95901 + ... + 98103.
It is an arithmetic number, because the mean of its divisors is an integer number (10250253).
Almost surely, 2213695406 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 213695406, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (246006072).
213695406 is an abundant number, since it is smaller than the sum of its proper divisors (278316738).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
213695406 is a wasteful number, since it uses less digits than its factorization.
213695406 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2545 (or 2542 counting only the distinct ones).
The product of its (nonzero) digits is 38880, while the sum is 36.
The square root of 213695406 is about 14618.3243225754. The cubic root of 213695406 is about 597.8584822634.
The spelling of 213695406 in words is "two hundred thirteen million, six hundred ninety-five thousand, four hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •