Base | Representation |
---|---|
bin | 110000001100111110… |
… | …1001110110111010001 |
3 | 100220012010011110100221 |
4 | 1200121331032313101 |
5 | 3143444230302134 |
6 | 115315355113041 |
7 | 10323122260012 |
oct | 1403175166721 |
9 | 326163143327 |
10 | 103514697169 |
11 | 3a99a391104 |
12 | 1808aa42781 |
13 | 99b8a23900 |
14 | 501db67009 |
15 | 2a5ca9b5b4 |
hex | 1819f4edd1 |
103514697169 has 9 divisors (see below), whose sum is σ = 112094408433. Its totient is φ = 95548167312.
The previous prime is 103514697109. The next prime is 103514697173. The reversal of 103514697169 is 961796415301.
The square root of 103514697169 is 321737.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 7236054225 + 96278642944 = 85065^2 + 310288^2 .
It is not a de Polignac number, because 103514697169 - 223 = 103506308561 is a prime.
It is a super-2 number, since 2×1035146971692 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103514697109) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 4170207 + ... + 4194955.
Almost surely, 2103514697169 is an apocalyptic number.
103514697169 is the 321737-th square number.
103514697169 is the 160869-th centered octagonal number.
It is an amenable number.
103514697169 is a deficient number, since it is larger than the sum of its proper divisors (8579711264).
103514697169 is an frugal number, since it uses more digits than its factorization.
103514697169 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49524 (or 24762 counting only the distinct ones).
The product of its (nonzero) digits is 1224720, while the sum is 52.
The spelling of 103514697169 in words is "one hundred three billion, five hundred fourteen million, six hundred ninety-seven thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •