Base | Representation |
---|---|
bin | 11001000101101011010000… |
… | …110100000100000101111101 |
3 | 112110200111221212021102021111 |
4 | 121011223100310010011331 |
5 | 103430312301031042141 |
6 | 1030402015321402021 |
7 | 32145614060422261 |
oct | 3105532064040575 |
9 | 473614855242244 |
10 | 110341213143421 |
11 | 3218149a2590a7 |
12 | 10460a49039311 |
13 | 49751935c9360 |
14 | 1d367868020a1 |
15 | cb536513d381 |
hex | 645ad0d0417d |
110341213143421 has 16 divisors (see below), whose sum is σ = 119186354048944. Its totient is φ = 101547372985344.
The previous prime is 110341213143391. The next prime is 110341213143493. The reversal of 110341213143421 is 124341312143011.
It can be written as a sum of positive squares in 8 ways, for example, as 2405507940900 + 107935705202521 = 1550970^2 + 10389211^2 .
It is not a de Polignac number, because 110341213143421 - 211 = 110341213141373 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110341213147421) 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, 5388565 + ... + 15802501.
It is an arithmetic number, because the mean of its divisors is an integer number (7449147128059).
Almost surely, 2110341213143421 is an apocalyptic number.
It is an amenable number.
110341213143421 is a deficient number, since it is larger than the sum of its proper divisors (8845140905523).
110341213143421 is a wasteful number, since it uses less digits than its factorization.
110341213143421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10416400.
The product of its (nonzero) digits is 6912, while the sum is 31.
Adding to 110341213143421 its reverse (124341312143011), we get a palindrome (234682525286432).
The spelling of 110341213143421 in words is "one hundred ten trillion, three hundred forty-one billion, two hundred thirteen million, one hundred forty-three thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •