Base | Representation |
---|---|
bin | 1001010100001110100100… |
… | …0100000111100011111101 |
3 | 1100021020021002201211212010 |
4 | 2111003221010013203331 |
5 | 2320310343211021131 |
6 | 33441342031201433 |
7 | 2105016604110606 |
oct | 225035104074375 |
9 | 40236232654763 |
10 | 10243112204541 |
11 | 329a096890627 |
12 | 1195225676279 |
13 | 593bc92390a8 |
14 | 275aaac70dad |
15 | 12b6a8208b46 |
hex | 950e91078fd |
10243112204541 has 8 divisors (see below), whose sum is σ = 14026604100064. Its totient is φ = 6644180889360.
The previous prime is 10243112204537. The next prime is 10243112204569. The reversal of 10243112204541 is 14540221134201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10243112204541 - 22 = 10243112204537 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10243112204499 and 10243112204508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10243112204041) 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, 46140144955 + ... + 46140145176.
It is an arithmetic number, because the mean of its divisors is an integer number (1753325512508).
Almost surely, 210243112204541 is an apocalyptic number.
It is an amenable number.
10243112204541 is a deficient number, since it is larger than the sum of its proper divisors (3783491895523).
10243112204541 is an equidigital number, since it uses as much as digits as its factorization.
10243112204541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92280290171.
The product of its (nonzero) digits is 7680, while the sum is 30.
Adding to 10243112204541 its reverse (14540221134201), we get a palindrome (24783333338742).
The spelling of 10243112204541 in words is "ten trillion, two hundred forty-three billion, one hundred twelve million, two hundred four thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •