Base | Representation |
---|---|
bin | 11110000100010011001… |
… | …00001111101110011111 |
3 | 10122202121112011022102101 |
4 | 33002021210033232133 |
5 | 113411242113144411 |
6 | 2110333305105531 |
7 | 134432120140240 |
oct | 17021144175637 |
9 | 3582545138371 |
10 | 1033100131231 |
11 | 369154100453 |
12 | 14827b1882a7 |
13 | 76561a035cc |
14 | 380064c0cc7 |
15 | 1bd176128c1 |
hex | f08990fb9f |
1033100131231 has 8 divisors (see below), whose sum is σ = 1180704040064. Its totient is φ = 885500766360.
The previous prime is 1033100131187. The next prime is 1033100131243. The reversal of 1033100131231 is 1321310013301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1033100131231 - 217 = 1033100000159 is a prime.
It is a super-2 number, since 2×10331001312312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1033100131199 and 1033100131208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1033100131331) 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, 634005 + ... + 1571038.
It is an arithmetic number, because the mean of its divisors is an integer number (147588005008).
Almost surely, 21033100131231 is an apocalyptic number.
1033100131231 is a deficient number, since it is larger than the sum of its proper divisors (147603908833).
1033100131231 is an equidigital number, since it uses as much as digits as its factorization.
1033100131231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2271981.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 1033100131231 its reverse (1321310013301), we get a palindrome (2354410144532).
The spelling of 1033100131231 in words is "one trillion, thirty-three billion, one hundred million, one hundred thirty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •