Base | Representation |
---|---|
bin | 1100000011010000001… |
… | …1000110011110111111 |
3 | 201210101101120221111011 |
4 | 3000310003012132333 |
5 | 11343000101032211 |
6 | 235035314540051 |
7 | 20646303026623 |
oct | 3006403063677 |
9 | 653341527434 |
10 | 207031658431 |
11 | 7a88aa79264 |
12 | 3415a597627 |
13 | 166a505ac00 |
14 | a03dd1d183 |
15 | 55ba943921 |
hex | 30340c67bf |
207031658431 has 12 divisors (see below), whose sum is σ = 224195108040. Its totient is φ = 191095151520.
The previous prime is 207031658413. The next prime is 207031658437. The reversal of 207031658431 is 134856130702.
207031658431 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 207031658431 - 27 = 207031658303 is a prime.
It is a super-2 number, since 2×2070316584312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (207031658437) 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, 5242821 + ... + 5282161.
It is an arithmetic number, because the mean of its divisors is an integer number (18682925670).
Almost surely, 2207031658431 is an apocalyptic number.
207031658431 is a deficient number, since it is larger than the sum of its proper divisors (17163449609).
207031658431 is a wasteful number, since it uses less digits than its factorization.
207031658431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70506 (or 70493 counting only the distinct ones).
The product of its (nonzero) digits is 120960, while the sum is 40.
The spelling of 207031658431 in words is "two hundred seven billion, thirty-one million, six hundred fifty-eight thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •