Base | Representation |
---|---|
bin | 1001010010001000001011… |
… | …0010110111100011111011 |
3 | 1100010210010221020201100212 |
4 | 2110202002302313203323 |
5 | 2314213002341340110 |
6 | 33413014203221335 |
7 | 2102301612110645 |
oct | 224420262674373 |
9 | 40123127221325 |
10 | 10207036668155 |
11 | 3285864114148 |
12 | 118a237b1784b |
13 | 59069a24b762 |
14 | 274047993895 |
15 | 12a796025e05 |
hex | 94882cb78fb |
10207036668155 has 4 divisors (see below), whose sum is σ = 12248444001792. Its totient is φ = 8165629334520.
The previous prime is 10207036668151. The next prime is 10207036668193. The reversal of 10207036668155 is 55186663070201.
10207036668155 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 10207036668155 - 22 = 10207036668151 is a prime.
It is a super-2 number, since 2×102070366681552 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10207036668151) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1020703666811 + ... + 1020703666820.
It is an arithmetic number, because the mean of its divisors is an integer number (3062111000448).
Almost surely, 210207036668155 is an apocalyptic number.
10207036668155 is a deficient number, since it is larger than the sum of its proper divisors (2041407333637).
10207036668155 is an equidigital number, since it uses as much as digits as its factorization.
10207036668155 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2041407333636.
The product of its (nonzero) digits is 1814400, while the sum is 50.
The spelling of 10207036668155 in words is "ten trillion, two hundred seven billion, thirty-six million, six hundred sixty-eight thousand, one hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •