Base | Representation |
---|---|
bin | 110000000100000101… |
… | …1011111100001011011 |
3 | 100212102022221201000222 |
4 | 1200020023133201123 |
5 | 3142341402224111 |
6 | 115230022350255 |
7 | 10312541211503 |
oct | 1401013374133 |
9 | 325368851028 |
10 | 103216445531 |
11 | 3a856aa1251 |
12 | 18006b8b38b |
13 | 996bcb8854 |
14 | 4dd22caa03 |
15 | 2a417d57db |
hex | 18082df85b |
103216445531 has 8 divisors (see below), whose sum is σ = 106036577424. Its totient is φ = 100397918880.
The previous prime is 103216445509. The next prime is 103216445551. The reversal of 103216445531 is 135544612301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103216445531 is a prime.
It is a super-2 number, since 2×1032164455312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103216445491 and 103216445500.
It is not an unprimeable number, because it can be changed into a prime (103216445551) 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 7 ways as a sum of consecutive naturals, for example, 270380 + ... + 528713.
It is an arithmetic number, because the mean of its divisors is an integer number (13254572178).
Almost surely, 2103216445531 is an apocalyptic number.
103216445531 is a deficient number, since it is larger than the sum of its proper divisors (2820131893).
103216445531 is an equidigital number, since it uses as much as digits as its factorization.
103216445531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 802621.
The product of its (nonzero) digits is 43200, while the sum is 35.
The spelling of 103216445531 in words is "one hundred three billion, two hundred sixteen million, four hundred forty-five thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •