Base | Representation |
---|---|
bin | 10010001100011100111… |
… | …000011100000100011111 |
3 | 11102112021221202000020220 |
4 | 102030130320130010133 |
5 | 130441123412241343 |
6 | 2354220013412423 |
7 | 156222044662452 |
oct | 22143470340437 |
9 | 4375257660226 |
10 | 1250320040223 |
11 | 4422920810a1 |
12 | 1823a179a113 |
13 | 90b9b751037 |
14 | 44731567499 |
15 | 227cc6ec183 |
hex | 1231ce1c11f |
1250320040223 has 8 divisors (see below), whose sum is σ = 1671562807728. Its totient is φ = 831311983104.
The previous prime is 1250320040201. The next prime is 1250320040257. The reversal of 1250320040223 is 3220400230521.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1250320040223 - 212 = 1250320036127 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1250320040193 and 1250320040202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1250320040273) 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 7 ways as a sum of consecutive naturals, for example, 558676290 + ... + 558678527.
It is an arithmetic number, because the mean of its divisors is an integer number (208945350966).
Almost surely, 21250320040223 is an apocalyptic number.
1250320040223 is a deficient number, since it is larger than the sum of its proper divisors (421242767505).
1250320040223 is a wasteful number, since it uses less digits than its factorization.
1250320040223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1117355193.
The product of its (nonzero) digits is 2880, while the sum is 24.
Adding to 1250320040223 its reverse (3220400230521), we get a palindrome (4470720270744).
The spelling of 1250320040223 in words is "one trillion, two hundred fifty billion, three hundred twenty million, forty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •