Base | Representation |
---|---|
bin | 1100000110011111111… |
… | …1000110110100010000 |
3 | 201212122010020000200200 |
4 | 3001213333012310100 |
5 | 11401241133321243 |
6 | 235302003215200 |
7 | 21010013365305 |
oct | 3014777066420 |
9 | 655563200620 |
10 | 207903026448 |
11 | 80197924a17 |
12 | 34362377500 |
13 | 167b373b1a0 |
14 | a0c39450ac |
15 | 561c1b6ad3 |
hex | 3067fc6d10 |
207903026448 has 60 divisors (see below), whose sum is σ = 626596627020. Its totient is φ = 63970161408.
The previous prime is 207903026389. The next prime is 207903026449. The reversal of 207903026448 is 844620309702.
207903026448 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 102779230464 + 105123795984 = 320592^2 + 324228^2 .
It is not an unprimeable number, because it can be changed into a prime (207903026449) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 55527783 + ... + 55531526.
It is an arithmetic number, because the mean of its divisors is an integer number (10443277117).
Almost surely, 2207903026448 is an apocalyptic number.
It is an amenable number.
207903026448 is an abundant number, since it is smaller than the sum of its proper divisors (418693600572).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
207903026448 is a wasteful number, since it uses less digits than its factorization.
207903026448 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111059336 (or 111059327 counting only the distinct ones).
The product of its (nonzero) digits is 580608, while the sum is 45.
The spelling of 207903026448 in words is "two hundred seven billion, nine hundred three million, twenty-six thousand, four hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •