Base | Representation |
---|---|
bin | 1001100100001000010… |
… | …0110111111100000000 |
3 | 120201010120001022000111 |
4 | 2121002010313330000 |
5 | 10143010214044300 |
6 | 203253014401104 |
7 | 14604636161431 |
oct | 2310204677400 |
9 | 521116038014 |
10 | 164317331200 |
11 | 63760938a80 |
12 | 27a19660194 |
13 | 12658846879 |
14 | 7d4b06d488 |
15 | 441a9e69ba |
hex | 2642137f00 |
164317331200 has 216 divisors, whose sum is σ = 444324842640. Its totient is φ = 59665612800.
The previous prime is 164317331197. The next prime is 164317331203. The reversal of 164317331200 is 2133713461.
It is an interprime number because it is at equal distance from previous prime (164317331197) and next prime (164317331203).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (164317331203) 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, 68779606 + ... + 68781994.
Almost surely, 2164317331200 is an apocalyptic number.
164317331200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 164317331200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (222162421320).
164317331200 is an abundant number, since it is smaller than the sum of its proper divisors (280007511440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
164317331200 is a wasteful number, since it uses less digits than its factorization.
164317331200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3403 (or 3384 counting only the distinct ones).
The product of its (nonzero) digits is 9072, while the sum is 31.
The spelling of 164317331200 in words is "one hundred sixty-four billion, three hundred seventeen million, three hundred thirty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •