Base | Representation |
---|---|
bin | 1001010011101001101011… |
… | …0110101010100001111001 |
3 | 1100020021201000012211220211 |
4 | 2110322122312222201321 |
5 | 2320130103242322223 |
6 | 33433023303151121 |
7 | 2104216325560435 |
oct | 224723266524171 |
9 | 40207630184824 |
10 | 10233210120313 |
11 | 3295975374144 |
12 | 11933214454a1 |
13 | 592cab91285b |
14 | 27540bb199c5 |
15 | 12b2c8c3cd0d |
hex | 94e9adaa879 |
10233210120313 has 8 divisors (see below), whose sum is σ = 10835194206240. Its totient is φ = 9631229428800.
The previous prime is 10233210120283. The next prime is 10233210120317. The reversal of 10233210120313 is 31302101233201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10233210120313 - 25 = 10233210120281 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10233210120317) 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 7 ways as a sum of consecutive naturals, for example, 7986298 + ... + 9178636.
It is an arithmetic number, because the mean of its divisors is an integer number (1354399275780).
Almost surely, 210233210120313 is an apocalyptic number.
It is an amenable number.
10233210120313 is a deficient number, since it is larger than the sum of its proper divisors (601984085927).
10233210120313 is a wasteful number, since it uses less digits than its factorization.
10233210120313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1697207.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 10233210120313 its reverse (31302101233201), we get a palindrome (41535311353514).
The spelling of 10233210120313 in words is "ten trillion, two hundred thirty-three billion, two hundred ten million, one hundred twenty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •