Base | Representation |
---|---|
bin | 1001101110110100111001… |
… | …0010101010100100100111 |
3 | 1101212220202202201012111121 |
4 | 2123231032102222210213 |
5 | 2400302224211101101 |
6 | 34431314133514411 |
7 | 2153024612156656 |
oct | 233551622524447 |
9 | 41786682635447 |
10 | 10700077050151 |
11 | 34559715a9625 |
12 | 12498b61a2a07 |
13 | 5c8022561c68 |
14 | 28dc5a76d19d |
15 | 138500b6a0a1 |
hex | 9bb4e4aa927 |
10700077050151 has 4 divisors (see below), whose sum is σ = 10927738264032. Its totient is φ = 10472415836272.
The previous prime is 10700077050101. The next prime is 10700077050191. The reversal of 10700077050151 is 15105077000701.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10700077050151 - 213 = 10700077041959 is a prime.
It is a super-2 number, since 2×107000770501512 (a number of 27 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 (10700077050101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 113830606870 + ... + 113830606963.
It is an arithmetic number, because the mean of its divisors is an integer number (2731934566008).
Almost surely, 210700077050151 is an apocalyptic number.
10700077050151 is a deficient number, since it is larger than the sum of its proper divisors (227661213881).
10700077050151 is an equidigital number, since it uses as much as digits as its factorization.
10700077050151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 227661213880.
The product of its (nonzero) digits is 8575, while the sum is 34.
The spelling of 10700077050151 in words is "ten trillion, seven hundred billion, seventy-seven million, fifty thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •