Base | Representation |
---|---|
bin | 110000001010010000… |
… | …0101001001010101100 |
3 | 100212221202012211212100 |
4 | 1200110200221022230 |
5 | 3143302332113102 |
6 | 115302332335100 |
7 | 10320632454345 |
oct | 1402440511254 |
9 | 325852184770 |
10 | 103423316652 |
11 | 3a952847617 |
12 | 18064314490 |
13 | 99a2b0a4b6 |
14 | 501197b0cc |
15 | 2a54a4aa1c |
hex | 18148292ac |
103423316652 has 18 divisors (see below), whose sum is σ = 261431161628. Its totient is φ = 34474438872.
The previous prime is 103423316629. The next prime is 103423316669. The reversal of 103423316652 is 256613324301.
It is a tau number, because it is divible by the number of its divisors (18).
It is a Harshad number since it is a multiple of its sum of digits (36), and also a Moran number because the ratio is a prime number: 2872869907 = 103423316652 / (1 + 0 + 3 + 4 + 2 + 3 + 3 + 1 + 6 + 6 + 5 + 2).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1436434918 + ... + 1436434989.
Almost surely, 2103423316652 is an apocalyptic number.
103423316652 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
103423316652 is an abundant number, since it is smaller than the sum of its proper divisors (158007844976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103423316652 is a wasteful number, since it uses less digits than its factorization.
103423316652 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2872869917 (or 2872869912 counting only the distinct ones).
The product of its (nonzero) digits is 77760, while the sum is 36.
The spelling of 103423316652 in words is "one hundred three billion, four hundred twenty-three million, three hundred sixteen thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •