Base | Representation |
---|---|
bin | 110000001000011111… |
… | …0110000010100111011 |
3 | 100212210121210101212011 |
4 | 1200100332300110323 |
5 | 3143142202221220 |
6 | 115252415230351 |
7 | 10316313236260 |
oct | 1402076602473 |
9 | 325717711764 |
10 | 103364101435 |
11 | 3a922382321 |
12 | 180485183b7 |
13 | 99937767ca |
14 | 5007b65267 |
15 | 2a4e75065a |
hex | 1810fb053b |
103364101435 has 64 divisors (see below), whose sum is σ = 151472056320. Its totient is φ = 66135813120.
The previous prime is 103364101429. The next prime is 103364101453. The reversal of 103364101435 is 534101463301.
It is not a de Polignac number, because 103364101435 - 23 = 103364101427 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 103364101397 and 103364101406.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 59369665 + ... + 59371405.
It is an arithmetic number, because the mean of its divisors is an integer number (2366750880).
Almost surely, 2103364101435 is an apocalyptic number.
103364101435 is a deficient number, since it is larger than the sum of its proper divisors (48107954885).
103364101435 is a wasteful number, since it uses less digits than its factorization.
103364101435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3068.
The product of its (nonzero) digits is 12960, while the sum is 31.
Adding to 103364101435 its reverse (534101463301), we get a palindrome (637465564736).
The spelling of 103364101435 in words is "one hundred three billion, three hundred sixty-four million, one hundred one thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •