Base | Representation |
---|---|
bin | 1001011111010011000111… |
… | …0100100001001100011111 |
3 | 1100221102012102002201220002 |
4 | 2113310301310201030133 |
5 | 2331414410210204043 |
6 | 34104555212244515 |
7 | 2124532116522452 |
oct | 227646164411437 |
9 | 40842172081802 |
10 | 10433311413023 |
11 | 336281932a024 |
12 | 1206066a7073b |
13 | 5a8b1ac08a35 |
14 | 280d91447499 |
15 | 1315db01ebb8 |
hex | 97d31d2131f |
10433311413023 has 32 divisors (see below), whose sum is σ = 11177018300160. Its totient is φ = 9710167092480.
The previous prime is 10433311412969. The next prime is 10433311413053. The reversal of 10433311413023 is 32031411333401.
It is not a de Polignac number, because 10433311413023 - 236 = 10364591936287 is a prime.
It is a super-2 number, since 2×104333114130232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10433311413053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1276866728 + ... + 1276874898.
It is an arithmetic number, because the mean of its divisors is an integer number (349281821880).
Almost surely, 210433311413023 is an apocalyptic number.
10433311413023 is a deficient number, since it is larger than the sum of its proper divisors (743706887137).
10433311413023 is a wasteful number, since it uses less digits than its factorization.
10433311413023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11799.
The product of its (nonzero) digits is 7776, while the sum is 29.
Adding to 10433311413023 its reverse (32031411333401), we get a palindrome (42464722746424).
The spelling of 10433311413023 in words is "ten trillion, four hundred thirty-three billion, three hundred eleven million, four hundred thirteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •