Base | Representation |
---|---|
bin | 110000001010011110… |
… | …0001010011111101010 |
3 | 100212222020210101011021 |
4 | 1200110330022133222 |
5 | 3143311203443200 |
6 | 115303151123054 |
7 | 10321051002520 |
oct | 1402474123752 |
9 | 325866711137 |
10 | 103430531050 |
11 | 3a956924930 |
12 | 1806681348a |
13 | 99a4465182 |
14 | 50128d8310 |
15 | 2a554c341a |
hex | 1814f0a7ea |
103430531050 has 96 divisors (see below), whose sum is σ = 240224517504. Its totient is φ = 32187936000.
The previous prime is 103430531047. The next prime is 103430531051. The reversal of 103430531050 is 50135034301.
103430531050 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (103430531051) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2493480 + ... + 2534620.
It is an arithmetic number, because the mean of its divisors is an integer number (2502338724).
Almost surely, 2103430531050 is an apocalyptic number.
103430531050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103430531050 is an abundant number, since it is smaller than the sum of its proper divisors (136793986454).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103430531050 is a wasteful number, since it uses less digits than its factorization.
103430531050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41824 (or 41819 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 25.
Adding to 103430531050 its reverse (50135034301), we get a palindrome (153565565351).
The spelling of 103430531050 in words is "one hundred three billion, four hundred thirty million, five hundred thirty-one thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •