Base | Representation |
---|---|
bin | 10011000000110001… |
… | …10111111111110001 |
3 | 222100100101210012221 |
4 | 21200120313333301 |
5 | 131401002140040 |
6 | 4404500521041 |
7 | 510640435111 |
oct | 114030677761 |
9 | 28310353187 |
10 | 10207068145 |
11 | 436869540a |
12 | 1b8a3b0181 |
13 | c6887a9c1 |
14 | 6cb865041 |
15 | 3eb16174a |
hex | 260637ff1 |
10207068145 has 8 divisors (see below), whose sum is σ = 12456083520. Its totient is φ = 8027253360.
The previous prime is 10207068127. The next prime is 10207068163. The reversal of 10207068145 is 54186070201.
10207068145 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (10207068127) and next prime (10207068163).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10207068145 - 211 = 10207066097 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10207068145.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 17299821 + ... + 17300410.
It is an arithmetic number, because the mean of its divisors is an integer number (1557010440).
Almost surely, 210207068145 is an apocalyptic number.
It is an amenable number.
10207068145 is a deficient number, since it is larger than the sum of its proper divisors (2249015375).
10207068145 is an equidigital number, since it uses as much as digits as its factorization.
10207068145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34600295.
The product of its (nonzero) digits is 13440, while the sum is 34.
The spelling of 10207068145 in words is "ten billion, two hundred seven million, sixty-eight thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •