Base | Representation |
---|---|
bin | 1000001110010000… |
… | …1111000001110000 |
3 | 12200211110011121120 |
4 | 2003210033001300 |
5 | 14010033022112 |
6 | 1003010222240 |
7 | 105461600610 |
oct | 20344170160 |
9 | 5624404546 |
10 | 2207314032 |
11 | a32a75780 |
12 | 517284980 |
13 | 2923c27a1 |
14 | 16d222a40 |
15 | cdbb3e8c |
hex | 8390f070 |
2207314032 has 160 divisors (see below), whose sum is σ = 7301865984. Its totient is φ = 557798400.
The previous prime is 2207313991. The next prime is 2207314061. The reversal of 2207314032 is 2304137022.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 2207313993 and 2207314011.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 128682 + ... + 144822.
Almost surely, 22207314032 is an apocalyptic number.
2207314032 is a gapful number since it is divisible by the number (22) 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 2207314032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3650932992).
2207314032 is an abundant number, since it is smaller than the sum of its proper divisors (5094551952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2207314032 is a wasteful number, since it uses less digits than its factorization.
2207314032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16207 (or 16201 counting only the distinct ones).
The product of its (nonzero) digits is 2016, while the sum is 24.
The square root of 2207314032 is about 46982.0607466297. The cubic root of 2207314032 is about 1302.0311506678.
The spelling of 2207314032 in words is "two billion, two hundred seven million, three hundred fourteen thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •