Base | Representation |
---|---|
bin | 1001101011100000101100… |
… | …0101101101010100100111 |
3 | 1101200110201222120111122220 |
4 | 2122320023011231110213 |
5 | 2343334044420131343 |
6 | 34345213551323423 |
7 | 2145640211605101 |
oct | 232701305552447 |
9 | 41613658514586 |
10 | 10643115005223 |
11 | 34337a0a56138 |
12 | 123a859820573 |
13 | 5c284531812c |
14 | 28b1b5562571 |
15 | 136cb9ea7183 |
hex | 9ae0b16d527 |
10643115005223 has 16 divisors (see below), whose sum is σ = 14204995983360. Its totient is φ = 7088322517344.
The previous prime is 10643115005183. The next prime is 10643115005269. The reversal of 10643115005223 is 32250051134601.
10643115005223 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10643115005223 - 220 = 10643113956647 is a prime.
It is a super-2 number, since 2×106431150052232 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10643115005323) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 127172290 + ... + 127255952.
It is an arithmetic number, because the mean of its divisors is an integer number (887812248960).
Almost surely, 210643115005223 is an apocalyptic number.
10643115005223 is a deficient number, since it is larger than the sum of its proper divisors (3561880978137).
10643115005223 is a wasteful number, since it uses less digits than its factorization.
10643115005223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 125518.
The product of its (nonzero) digits is 21600, while the sum is 33.
Adding to 10643115005223 its reverse (32250051134601), we get a palindrome (42893166139824).
The spelling of 10643115005223 in words is "ten trillion, six hundred forty-three billion, one hundred fifteen million, five thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •