Base | Representation |
---|---|
bin | 101110101101111011… |
… | …1000111011110011011 |
3 | 100120221211222112200112 |
4 | 1131123313013132123 |
5 | 3120431302014003 |
6 | 114031105554535 |
7 | 10151105011421 |
oct | 1353367073633 |
9 | 316854875615 |
10 | 100325423003 |
11 | 396030a4233 |
12 | 1753a945a4b |
13 | 95cb06c130 |
14 | 4bda371111 |
15 | 2922abb3d8 |
hex | 175bdc779b |
100325423003 has 8 divisors (see below), whose sum is σ = 110962838448. Its totient is φ = 90105161184.
The previous prime is 100325422997. The next prime is 100325423053. The reversal of 100325423003 is 300324523001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100325423003 - 216 = 100325357467 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 100325423003.
It is not an unprimeable number, because it can be changed into a prime (100325423053) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 104287901 + ... + 104288862.
It is an arithmetic number, because the mean of its divisors is an integer number (13870354806).
Almost surely, 2100325423003 is an apocalyptic number.
100325423003 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
100325423003 is a deficient number, since it is larger than the sum of its proper divisors (10637415445).
100325423003 is a wasteful number, since it uses less digits than its factorization.
100325423003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 208576813.
The product of its (nonzero) digits is 2160, while the sum is 23.
Adding to 100325423003 its reverse (300324523001), we get a palindrome (400649946004).
The spelling of 100325423003 in words is "one hundred billion, three hundred twenty-five million, four hundred twenty-three thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •