Base | Representation |
---|---|
bin | 10111011110100011010010… |
… | …010111001110110110000001 |
3 | 111112121001000122100010020200 |
4 | 113132203102113032312001 |
5 | 102013210301013220223 |
6 | 1003334252100155413 |
7 | 30514615556102412 |
oct | 2736432227166601 |
9 | 445531018303220 |
10 | 103254543101313 |
11 | 2a99a00781638a |
12 | b6b7509698b69 |
13 | 457cb2801c856 |
14 | 1b6d791a45809 |
15 | be0d4aad1a43 |
hex | 5de8d25ced81 |
103254543101313 has 24 divisors (see below), whose sum is σ = 149199891929088. Its totient is φ = 68811238945152.
The previous prime is 103254543101287. The next prime is 103254543101387. The reversal of 103254543101313 is 313101345452301.
103254543101313 is a `hidden beast` number, since 1 + 0 + 3 + 2 + 5 + 4 + 543 + 101 + 3 + 1 + 3 = 666.
It is not a de Polignac number, because 103254543101313 - 214 = 103254543084929 is a prime.
It is not an unprimeable number, because it can be changed into a prime (103254543101513) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 386273481 + ... + 386540697.
It is an arithmetic number, because the mean of its divisors is an integer number (6216662163712).
Almost surely, 2103254543101313 is an apocalyptic number.
It is an amenable number.
103254543101313 is a deficient number, since it is larger than the sum of its proper divisors (45945348827775).
103254543101313 is a wasteful number, since it uses less digits than its factorization.
103254543101313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 282733 (or 282730 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 36.
Adding to 103254543101313 its reverse (313101345452301), we get a palindrome (416355888553614).
The spelling of 103254543101313 in words is "one hundred three trillion, two hundred fifty-four billion, five hundred forty-three million, one hundred one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •