Base | Representation |
---|---|
bin | 10011000011111011… |
… | …10000110001111011 |
3 | 222102012011102122221 |
4 | 21201331300301323 |
5 | 131424234441011 |
6 | 4411243424511 |
7 | 511411305040 |
oct | 114175606173 |
9 | 28365142587 |
10 | 10233515131 |
11 | 4381609424 |
12 | 1b97225137 |
13 | c711aa6c8 |
14 | 6d118b1c7 |
15 | 3ed637971 |
hex | 261f70c7b |
10233515131 has 16 divisors (see below), whose sum is σ = 11945721600. Its totient is φ = 8585179488.
The previous prime is 10233515113. The next prime is 10233515141. The reversal of 10233515131 is 13151533201.
It is a cyclic number.
It is not a de Polignac number, because 10233515131 - 225 = 10199960699 is a prime.
It is a super-2 number, since 2×102335151312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10233515096 and 10233515105.
It is not an unprimeable number, because it can be changed into a prime (10233515111) 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 15 ways as a sum of consecutive naturals, for example, 40476 + ... + 148678.
It is an arithmetic number, because the mean of its divisors is an integer number (746607600).
Almost surely, 210233515131 is an apocalyptic number.
10233515131 is a deficient number, since it is larger than the sum of its proper divisors (1712206469).
10233515131 is a wasteful number, since it uses less digits than its factorization.
10233515131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108498.
The product of its (nonzero) digits is 1350, while the sum is 25.
The spelling of 10233515131 in words is "ten billion, two hundred thirty-three million, five hundred fifteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •