Base | Representation |
---|---|
bin | 10011001111110010… |
… | …10110010000101111 |
3 | 222200010101212101001 |
4 | 21213321112100233 |
5 | 132130223134411 |
6 | 4425200301131 |
7 | 514030142221 |
oct | 114771262057 |
9 | 28603355331 |
10 | 10333021231 |
11 | 44227a2875 |
12 | 20046117a7 |
13 | c889aa460 |
14 | 700490411 |
15 | 407240dc1 |
hex | 267e5642f |
10333021231 has 8 divisors (see below), whose sum is σ = 11136273344. Its totient is φ = 9530969760.
The previous prime is 10333021229. The next prime is 10333021271. The reversal of 10333021231 is 13212033301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10333021231 - 21 = 10333021229 is a prime.
It is a super-2 number, since 2×103330212312 (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 = 10333021199 and 10333021208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10333021201) 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 7 ways as a sum of consecutive naturals, for example, 282240 + ... + 316741.
It is an arithmetic number, because the mean of its divisors is an integer number (1392034168).
Almost surely, 210333021231 is an apocalyptic number.
10333021231 is a deficient number, since it is larger than the sum of its proper divisors (803252113).
10333021231 is a wasteful number, since it uses less digits than its factorization.
10333021231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 600321.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 10333021231 its reverse (13212033301), we get a palindrome (23545054532).
The spelling of 10333021231 in words is "ten billion, three hundred thirty-three million, twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •