Base | Representation |
---|---|
bin | 1001000110101011011011… |
… | …1101010000101101011111 |
3 | 1022102222110000222221210021 |
4 | 2101222312331100231133 |
5 | 2303002140341442343 |
6 | 33142404354053011 |
7 | 2052136432140442 |
oct | 221526675205537 |
9 | 38388400887707 |
10 | 10010343312223 |
11 | 320a3a9915641 |
12 | 11580a387a167 |
13 | 577c81cc9b07 |
14 | 268708adb659 |
15 | 1255d30180ed |
hex | 91ab6f50b5f |
10010343312223 has 8 divisors (see below), whose sum is σ = 10014314757120. Its totient is φ = 10006372195800.
The previous prime is 10010343312191. The next prime is 10010343312239. The reversal of 10010343312223 is 32221334301001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10010343312223 - 25 = 10010343312191 is a prime.
It is a super-2 number, since 2×100103433122232 (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 (10010343312523) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 73827336 + ... + 73962802.
It is an arithmetic number, because the mean of its divisors is an integer number (1251789344640).
Almost surely, 210010343312223 is an apocalyptic number.
10010343312223 is a deficient number, since it is larger than the sum of its proper divisors (3971444897).
10010343312223 is a wasteful number, since it uses less digits than its factorization.
10010343312223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164237.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 10010343312223 its reverse (32221334301001), we get a palindrome (42231677613224).
The spelling of 10010343312223 in words is "ten trillion, ten billion, three hundred forty-three million, three hundred twelve thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •