Base | Representation |
---|---|
bin | 11101000111011101111… |
… | …11110011000010111001 |
3 | 10112122022112100011012021 |
4 | 32203232333303002321 |
5 | 112342401140123413 |
6 | 2043332522314441 |
7 | 132164613442552 |
oct | 16435677630271 |
9 | 3478275304167 |
10 | 1000442114233 |
11 | 356315545961 |
12 | 141a86058a21 |
13 | 73458a640b3 |
14 | 365c9051329 |
15 | 1b05549818d |
hex | e8eeff30b9 |
1000442114233 has 4 divisors (see below), whose sum is σ = 1000651110480. Its totient is φ = 1000233117988.
The previous prime is 1000442114209. The next prime is 1000442114237. The reversal of 1000442114233 is 3324112440001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1000442114233 - 25 = 1000442114201 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1000442114198 and 1000442114207.
It is not an unprimeable number, because it can be changed into a prime (1000442114237) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 104490943 + ... + 104500516.
It is an arithmetic number, because the mean of its divisors is an integer number (250162777620).
Almost surely, 21000442114233 is an apocalyptic number.
It is an amenable number.
1000442114233 is a deficient number, since it is larger than the sum of its proper divisors (208996247).
1000442114233 is an equidigital number, since it uses as much as digits as its factorization.
1000442114233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 208996246.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 1000442114233 its reverse (3324112440001), we get a palindrome (4324554554234).
The spelling of 1000442114233 in words is "one trillion, four hundred forty-two million, one hundred fourteen thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •