Base | Representation |
---|---|
bin | 1001010011100101101010… |
… | …1001110001110001101111 |
3 | 1100020011220221102111001010 |
4 | 2110321122221301301233 |
5 | 2320120402022002203 |
6 | 33432324344520303 |
7 | 2104150536320034 |
oct | 224713251616157 |
9 | 40204827374033 |
10 | 10232133000303 |
11 | 3295472366a15 |
12 | 1193080780093 |
13 | 592b69713136 |
14 | 275348a5538b |
15 | 12b2643c6303 |
hex | 94e5aa71c6f |
10232133000303 has 4 divisors (see below), whose sum is σ = 13642844000408. Its totient is φ = 6821422000200.
The previous prime is 10232133000281. The next prime is 10232133000337. The reversal of 10232133000303 is 30300033123201.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 10232133000303 - 237 = 10094694046831 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10232133000303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10232133000203) 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, 1705355500048 + ... + 1705355500053.
It is an arithmetic number, because the mean of its divisors is an integer number (3410711000102).
Almost surely, 210232133000303 is an apocalyptic number.
10232133000303 is a deficient number, since it is larger than the sum of its proper divisors (3410711000105).
10232133000303 is an equidigital number, since it uses as much as digits as its factorization.
10232133000303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3410711000104.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 10232133000303 its reverse (30300033123201), we get a palindrome (40532166123504).
The spelling of 10232133000303 in words is "ten trillion, two hundred thirty-two billion, one hundred thirty-three million, three hundred three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.182 sec. • engine limits •