Base | Representation |
---|---|
bin | 10011011100100110… |
… | …00000010001111001 |
3 | 222221121110210101111 |
4 | 21232103000101321 |
5 | 132340221111413 |
6 | 4443554120321 |
7 | 516503010541 |
oct | 115623002171 |
9 | 28847423344 |
10 | 10440410233 |
11 | 4478380810 |
12 | 20345800a1 |
13 | ca500a246 |
14 | 710846321 |
15 | 4118a4d3d |
hex | 26e4c0479 |
10440410233 has 4 divisors (see below), whose sum is σ = 11389538448. Its totient is φ = 9491282020.
The previous prime is 10440410231. The next prime is 10440410251. The reversal of 10440410233 is 33201404401.
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, and also an emirpimes, since its reverse is a distinct semiprime: 33201404401 = 11 ⋅3018309491.
It is not a de Polignac number, because 10440410233 - 21 = 10440410231 is a prime.
It is a super-2 number, since 2×104404102332 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10440410231) 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, 474564091 + ... + 474564112.
It is an arithmetic number, because the mean of its divisors is an integer number (2847384612).
Almost surely, 210440410233 is an apocalyptic number.
It is an amenable number.
10440410233 is a deficient number, since it is larger than the sum of its proper divisors (949128215).
10440410233 is an equidigital number, since it uses as much as digits as its factorization.
10440410233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 949128214.
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 10440410233 its reverse (33201404401), we get a palindrome (43641814634).
The spelling of 10440410233 in words is "ten billion, four hundred forty million, four hundred ten thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •