Base | Representation |
---|---|
bin | 10011011011101111… |
… | …01000000011110101 |
3 | 222221002222011021021 |
4 | 21231313220003311 |
5 | 132331401430031 |
6 | 4443140221141 |
7 | 516355006222 |
oct | 115567500365 |
9 | 28832864237 |
10 | 10433233141 |
11 | 4474319531 |
12 | 203209a7b1 |
13 | ca3696546 |
14 | 70d8d8949 |
15 | 410e38511 |
hex | 26dde80f5 |
10433233141 has 4 divisors (see below), whose sum is σ = 10687702284. Its totient is φ = 10178764000.
The previous prime is 10433233133. The next prime is 10433233157. The reversal of 10433233141 is 14133233401.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 325946916 + 10107286225 = 18054^2 + 100535^2 .
It is a cyclic number.
It is not a de Polignac number, because 10433233141 - 23 = 10433233133 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10433233121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 127234510 + ... + 127234591.
It is an arithmetic number, because the mean of its divisors is an integer number (2671925571).
Almost surely, 210433233141 is an apocalyptic number.
It is an amenable number.
10433233141 is a deficient number, since it is larger than the sum of its proper divisors (254469143).
10433233141 is an equidigital number, since it uses as much as digits as its factorization.
10433233141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 254469142.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 10433233141 its reverse (14133233401), we get a palindrome (24566466542).
The spelling of 10433233141 in words is "ten billion, four hundred thirty-three million, two hundred thirty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •