Base | Representation |
---|---|
bin | 11000101100001… |
… | …10011010001100 |
3 | 112102201210020120 |
4 | 30112012122030 |
5 | 411010320022 |
6 | 32315144540 |
7 | 5063330301 |
oct | 1426063214 |
9 | 472653216 |
10 | 207120012 |
11 | a6a06370 |
12 | 59445150 |
13 | 33bab028 |
14 | 1d7170a8 |
15 | 132b3d5c |
hex | c58668c |
207120012 has 48 divisors (see below), whose sum is σ = 528108672. Its totient is φ = 62657280.
The previous prime is 207119989. The next prime is 207120019. The reversal of 207120012 is 210021702.
207120012 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 207119973 and 207120000.
It is not an unprimeable number, because it can be changed into a prime (207120019) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 115668 + ... + 117444.
It is an arithmetic number, because the mean of its divisors is an integer number (11002264).
Almost surely, 2207120012 is an apocalyptic number.
207120012 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
207120012 is an abundant number, since it is smaller than the sum of its proper divisors (320988660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
207120012 is a wasteful number, since it uses less digits than its factorization.
207120012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2678 (or 2676 counting only the distinct ones).
The product of its (nonzero) digits is 56, while the sum is 15.
The square root of 207120012 is about 14391.6646709128. The cubic root of 207120012 is about 591.6624681401.
Adding to 207120012 its reverse (210021702), we get a palindrome (417141714).
The spelling of 207120012 in words is "two hundred seven million, one hundred twenty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •