Base | Representation |
---|---|
bin | 110000001011101011… |
… | …0101110100101110000 |
3 | 100220002002000220102202 |
4 | 1200113112232211300 |
5 | 3143402042032242 |
6 | 115311155402332 |
7 | 10322052256046 |
oct | 1402726564560 |
9 | 326062026382 |
10 | 103471049072 |
11 | 3a9777896a6 |
12 | 180782b33a8 |
13 | 99ac980731 |
14 | 5018044396 |
15 | 2a58d28932 |
hex | 18175ae970 |
103471049072 has 80 divisors (see below), whose sum is σ = 223489148160. Its totient is φ = 46181684736.
The previous prime is 103471049057. The next prime is 103471049089. The reversal of 103471049072 is 270940174301.
It is a happy number.
It is a super-2 number, since 2×1034710490722 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (38).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 358028 + ... + 578900.
It is an arithmetic number, because the mean of its divisors is an integer number (2793614352).
Almost surely, 2103471049072 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 103471049072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (111744574080).
103471049072 is an abundant number, since it is smaller than the sum of its proper divisors (120018099088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103471049072 is a wasteful number, since it uses less digits than its factorization.
103471049072 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 220990 (or 220984 counting only the distinct ones).
The product of its (nonzero) digits is 42336, while the sum is 38.
The spelling of 103471049072 in words is "one hundred three billion, four hundred seventy-one million, forty-nine thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •