Base | Representation |
---|---|
bin | 10111011100010011110001… |
… | …001011100101101001010101 |
3 | 111112001022021000122112020111 |
4 | 113130103301023211221111 |
5 | 102003144200434220041 |
6 | 1003135404444203021 |
7 | 30500522022423205 |
oct | 2734236113455125 |
9 | 445038230575214 |
10 | 103100441320021 |
11 | 2a93a719336242 |
12 | b691681239471 |
13 | 456b439a33492 |
14 | 1b66133608405 |
15 | bdbd2bd74981 |
hex | 5dc4f12e5a55 |
103100441320021 has 16 divisors (see below), whose sum is σ = 105017919552000. Its totient is φ = 101188698774768.
The previous prime is 103100441319959. The next prime is 103100441320027. The reversal of 103100441320021 is 120023144001301.
It is a cyclic number.
It is not a de Polignac number, because 103100441320021 - 233 = 103091851385429 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103100441319974 and 103100441320001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103100441320027) 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, 175525206 + ... + 176111608.
It is an arithmetic number, because the mean of its divisors is an integer number (6563619972000).
Almost surely, 2103100441320021 is an apocalyptic number.
It is an amenable number.
103100441320021 is a deficient number, since it is larger than the sum of its proper divisors (1917478231979).
103100441320021 is an equidigital number, since it uses as much as digits as its factorization.
103100441320021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 591288.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 103100441320021 its reverse (120023144001301), we get a palindrome (223123585321322).
The spelling of 103100441320021 in words is "one hundred three trillion, one hundred billion, four hundred forty-one million, three hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •