Base | Representation |
---|---|
bin | 10111100000110110111101… |
… | …111000111010101100110001 |
3 | 111120011012022200022220220022 |
4 | 113200312331320322230301 |
5 | 102023310024012300423 |
6 | 1003535154540053225 |
7 | 30532231232310506 |
oct | 2740667570725461 |
9 | 446135280286808 |
10 | 103413113400113 |
11 | 2aa502895a3900 |
12 | b7221a2534215 |
13 | 4591a7900ba1a |
14 | 1b773157154ad |
15 | be502bcaddc8 |
hex | 5e0dbde3ab31 |
103413113400113 has 12 divisors (see below), whose sum is σ = 113669263490244. Its totient is φ = 94011669734400.
The previous prime is 103413113400019. The next prime is 103413113400131. The reversal of 103413113400113 is 311004311314301.
It can be written as a sum of positive squares in 2 ways, for example, as 39270425958544 + 64142687441569 = 6266612^2 + 8008913^2 .
It is not a de Polignac number, because 103413113400113 - 212 = 103413113396017 is a prime.
It is not an unprimeable number, because it can be changed into a prime (103413113400133) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 56033693 + ... + 57849813.
It is an arithmetic number, because the mean of its divisors is an integer number (9472438624187).
Almost surely, 2103413113400113 is an apocalyptic number.
It is an amenable number.
103413113400113 is a deficient number, since it is larger than the sum of its proper divisors (10256150090131).
103413113400113 is a wasteful number, since it uses less digits than its factorization.
103413113400113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2286736 (or 2286725 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 26.
Adding to 103413113400113 its reverse (311004311314301), we get a palindrome (414417424714414).
The spelling of 103413113400113 in words is "one hundred three trillion, four hundred thirteen billion, one hundred thirteen million, four hundred thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •