Base | Representation |
---|---|
bin | 1001001101010000000000… |
… | …1010010010010100011111 |
3 | 1022211202212001012001212010 |
4 | 2103110000022102110133 |
5 | 2311324344044110101 |
6 | 33310315203042303 |
7 | 2063244224310411 |
oct | 223240012222437 |
9 | 38752761161763 |
10 | 10123240613151 |
11 | 3253273460826 |
12 | 1175b50970393 |
13 | 585804831063 |
14 | 26dd789d29b1 |
15 | 1284de66a2d6 |
hex | 9350029251f |
10123240613151 has 4 divisors (see below), whose sum is σ = 13497654150872. Its totient is φ = 6748827075432.
The previous prime is 10123240613147. The next prime is 10123240613153. The reversal of 10123240613151 is 15131604232101.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 10123240613151 - 22 = 10123240613147 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10123240613153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1687206768856 + ... + 1687206768861.
It is an arithmetic number, because the mean of its divisors is an integer number (3374413537718).
Almost surely, 210123240613151 is an apocalyptic number.
10123240613151 is a deficient number, since it is larger than the sum of its proper divisors (3374413537721).
10123240613151 is an equidigital number, since it uses as much as digits as its factorization.
10123240613151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3374413537720.
The product of its (nonzero) digits is 4320, while the sum is 30.
Adding to 10123240613151 its reverse (15131604232101), we get a palindrome (25254844845252).
The spelling of 10123240613151 in words is "ten trillion, one hundred twenty-three billion, two hundred forty million, six hundred thirteen thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •