Base | Representation |
---|---|
bin | 110000000100100010… |
… | …0010010001010001001 |
3 | 100212110100222001210202 |
4 | 1200021010102022021 |
5 | 3142404210124001 |
6 | 115231313421545 |
7 | 10313111565266 |
oct | 1401104221211 |
9 | 325410861722 |
10 | 103231333001 |
11 | 3a86443a445 |
12 | 1800bb6a8b5 |
13 | 99720cbbc4 |
14 | 4dd428426d |
15 | 2a42c7696b |
hex | 1809112289 |
103231333001 has 8 divisors (see below), whose sum is σ = 109383747840. Its totient is φ = 97087805248.
The previous prime is 103231332979. The next prime is 103231333003. The reversal of 103231333001 is 100333132301.
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 103231333001 - 222 = 103227138697 is a prime.
It is a super-2 number, since 2×1032313330012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103231333003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2197841 + ... + 2244318.
It is an arithmetic number, because the mean of its divisors is an integer number (13672968480).
Almost surely, 2103231333001 is an apocalyptic number.
It is an amenable number.
103231333001 is a deficient number, since it is larger than the sum of its proper divisors (6152414839).
103231333001 is a wasteful number, since it uses less digits than its factorization.
103231333001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4443543.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 103231333001 its reverse (100333132301), we get a palindrome (203564465302).
The spelling of 103231333001 in words is "one hundred three billion, two hundred thirty-one million, three hundred thirty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •