Base | Representation |
---|---|
bin | 1001010011101001101111… |
… | …0000101101000011100011 |
3 | 1100020021202001211211120011 |
4 | 2110322123300231003203 |
5 | 2320130121141210021 |
6 | 33433025005225351 |
7 | 2104216602106240 |
oct | 224723360550343 |
9 | 40207661754504 |
10 | 10233225335011 |
11 | 3295982a16178 |
12 | 1193326562257 |
13 | 592cb1b0bb33 |
14 | 27540db5a5c7 |
15 | 12b2ca245de1 |
hex | 94e9bc2d0e3 |
10233225335011 has 16 divisors (see below), whose sum is σ = 12012139439104. Its totient is φ = 8533604552544.
The previous prime is 10233225335009. The next prime is 10233225335063. The reversal of 10233225335011 is 11053352233201.
10233225335011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 10233225335011 - 21 = 10233225335009 is a prime.
It is a super-2 number, since 2×102332253350112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10233225336011) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1780546 + ... + 4861768.
It is an arithmetic number, because the mean of its divisors is an integer number (750758714944).
Almost surely, 210233225335011 is an apocalyptic number.
10233225335011 is a deficient number, since it is larger than the sum of its proper divisors (1778914104093).
10233225335011 is a wasteful number, since it uses less digits than its factorization.
10233225335011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3094090.
The product of its (nonzero) digits is 16200, while the sum is 31.
Adding to 10233225335011 its reverse (11053352233201), we get a palindrome (21286577568212).
The spelling of 10233225335011 in words is "ten trillion, two hundred thirty-three billion, two hundred twenty-five million, three hundred thirty-five thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •