Base | Representation |
---|---|
bin | 101111111110110110… |
… | …0000100000010010000 |
3 | 100211222001202102001020 |
4 | 1133331230010002100 |
5 | 3142011322344240 |
6 | 115200334035440 |
7 | 10305303145335 |
oct | 1377554040220 |
9 | 324861672036 |
10 | 103040434320 |
11 | 3a77670343a |
12 | 17b78048b80 |
13 | 99416b03c5 |
14 | 4db6b9098c |
15 | 2a311190d0 |
hex | 17fdb04090 |
103040434320 has 80 divisors (see below), whose sum is σ = 322588049472. Its totient is φ = 27205388800.
The previous prime is 103040434319. The next prime is 103040434403. The reversal of 103040434320 is 23434040301.
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-2 number, since 2×1030404343202 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
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 15 ways as a sum of consecutive naturals, for example, 2101182 + ... + 2149661.
Almost surely, 2103040434320 is an apocalyptic number.
103040434320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103040434320 is an abundant number, since it is smaller than the sum of its proper divisors (219547615152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103040434320 is a wasteful number, since it uses less digits than its factorization.
103040434320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4250960 (or 4250954 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 24.
Adding to 103040434320 its reverse (23434040301), we get a palindrome (126474474621).
The spelling of 103040434320 in words is "one hundred three billion, forty million, four hundred thirty-four thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •