Base | Representation |
---|---|
bin | 10111011111001110100101… |
… | …010010000100100100011011 |
3 | 111112202111000111022002120001 |
4 | 113133032211102010210123 |
5 | 102014441003020222133 |
6 | 1003411501054113431 |
7 | 30521152600201021 |
oct | 2737164522044433 |
9 | 445674014262501 |
10 | 103301031414043 |
11 | 2aa077a31a9851 |
12 | b7045224ab877 |
13 | 45843263903c8 |
14 | 1b71b21c14711 |
15 | be216c00b87d |
hex | 5df3a548491b |
103301031414043 has 4 divisors (see below), whose sum is σ = 103301106860848. Its totient is φ = 103300955967240.
The previous prime is 103301031414037. The next prime is 103301031414073. The reversal of 103301031414043 is 340414130103301.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103301031414043 is a prime.
It is a super-2 number, since 2×1033010314140432 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103301031414073) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 35630928 + ... + 38420893.
It is an arithmetic number, because the mean of its divisors is an integer number (25825276715212).
Almost surely, 2103301031414043 is an apocalyptic number.
103301031414043 is a deficient number, since it is larger than the sum of its proper divisors (75446805).
103301031414043 is an equidigital number, since it uses as much as digits as its factorization.
103301031414043 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 75446804.
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 103301031414043 its reverse (340414130103301), we get a palindrome (443715161517344).
The spelling of 103301031414043 in words is "one hundred three trillion, three hundred one billion, thirty-one million, four hundred fourteen thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •