Base | Representation |
---|---|
bin | 111110001011001… |
… | …101011111010111 |
3 | 2200200211022011212 |
4 | 332023031133113 |
5 | 4114020014411 |
6 | 251301452035 |
7 | 34564266230 |
oct | 7613153727 |
9 | 2620738155 |
10 | 1043126231 |
11 | 4958aa1a4 |
12 | 25141101b |
13 | 138159974 |
14 | 9c776087 |
15 | 6189e68b |
hex | 3e2cd7d7 |
1043126231 has 8 divisors (see below), whose sum is σ = 1214637984. Its totient is φ = 877237920.
The previous prime is 1043126221. The next prime is 1043126261. The reversal of 1043126231 is 1326213401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1043126231 is a prime.
It is a super-2 number, since 2×10431262312 = 2176224667600530722, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1043126197 and 1043126206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1043126221) 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, 1405460 + ... + 1406201.
It is an arithmetic number, because the mean of its divisors is an integer number (151829748).
Almost surely, 21043126231 is an apocalyptic number.
1043126231 is a deficient number, since it is larger than the sum of its proper divisors (171511753).
1043126231 is an equidigital number, since it uses as much as digits as its factorization.
1043126231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2811721.
The product of its (nonzero) digits is 864, while the sum is 23.
The square root of 1043126231 is about 32297.4647766663. The cubic root of 1043126231 is about 1014.1735711053.
Adding to 1043126231 its reverse (1326213401), we get a palindrome (2369339632).
The spelling of 1043126231 in words is "one billion, forty-three million, one hundred twenty-six thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •