Base | Representation |
---|---|
bin | 110000001010000010… |
… | …1001111011001101011 |
3 | 100212221020200220001120 |
4 | 1200110011033121223 |
5 | 3143244012230402 |
6 | 115301514350323 |
7 | 10320514425411 |
oct | 1402405173153 |
9 | 325836626046 |
10 | 103416133227 |
11 | 3a949790600 |
12 | 18061a2b3a3 |
13 | 99a1493954 |
14 | 5010a2b2b1 |
15 | 2a540cc3bc |
hex | 181414f66b |
103416133227 has 48 divisors (see below), whose sum is σ = 152711498016. Its totient is φ = 62203187200.
The previous prime is 103416133181. The next prime is 103416133253. The reversal of 103416133227 is 722331614301.
It is a happy number.
It is not a de Polignac number, because 103416133227 - 28 = 103416132971 is a prime.
It is a super-2 number, since 2×1034161332272 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (103416133297) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 32965003 + ... + 32968139.
It is an arithmetic number, because the mean of its divisors is an integer number (3181489542).
Almost surely, 2103416133227 is an apocalyptic number.
103416133227 is a deficient number, since it is larger than the sum of its proper divisors (49295364789).
103416133227 is a wasteful number, since it uses less digits than its factorization.
103416133227 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3820 (or 3809 counting only the distinct ones).
The product of its (nonzero) digits is 18144, while the sum is 33.
Adding to 103416133227 its reverse (722331614301), we get a palindrome (825747747528).
The spelling of 103416133227 in words is "one hundred three billion, four hundred sixteen million, one hundred thirty-three thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •