Base | Representation |
---|---|
bin | 101111111110000010… |
… | …0101000110100010000 |
3 | 100211220011201221221020 |
4 | 1133330010220310100 |
5 | 3141432402301000 |
6 | 115153524555440 |
7 | 10304523534561 |
oct | 1377404506420 |
9 | 324804657836 |
10 | 103013322000 |
11 | 3a762375566 |
12 | 17b6ab52b80 |
13 | 9938ba9904 |
14 | 4db3334168 |
15 | 2a2da60ba0 |
hex | 17fc128d10 |
103013322000 has 80 divisors (see below), whose sum is σ = 332114969472. Its totient is φ = 27470217600.
The previous prime is 103013321987. The next prime is 103013322053. The reversal of 103013322000 is 223310301.
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-2 number, since 2×1030133220002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
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, 8578444 + ... + 8590443.
Almost surely, 2103013322000 is an apocalyptic number.
103013322000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103013322000 is an abundant number, since it is smaller than the sum of its proper divisors (229101647472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103013322000 is a wasteful number, since it uses less digits than its factorization.
103013322000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17168913 (or 17168897 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 103013322000 its reverse (223310301), we get a palindrome (103236632301).
The spelling of 103013322000 in words is "one hundred three billion, thirteen million, three hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •