Base | Representation |
---|---|
bin | 1001010011011110100000… |
… | …0101111101111100001001 |
3 | 1100012222221222212021102200 |
4 | 2110313220011331330021 |
5 | 2320102433004312223 |
6 | 33431405525550413 |
7 | 2104052110552500 |
oct | 224675005757411 |
9 | 40188858767380 |
10 | 10230211010313 |
11 | 3294676461438 |
12 | 1192824b75409 |
13 | 592921480458 |
14 | 2752056a5837 |
15 | 12b1a07c2a43 |
hex | 94de817df09 |
10230211010313 has 72 divisors (see below), whose sum is σ = 17241040252800. Its totient is φ = 5828338514880.
The previous prime is 10230211010309. The next prime is 10230211010333. The reversal of 10230211010313 is 31301011203201.
10230211010313 is a `hidden beast` number, since 1 + 0 + 230 + 2 + 110 + 10 + 313 = 666.
It is not a de Polignac number, because 10230211010313 - 22 = 10230211010309 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10230211010333) 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 71 ways as a sum of consecutive naturals, for example, 294402606 + ... + 294437352.
It is an arithmetic number, because the mean of its divisors is an integer number (239458892400).
Almost surely, 210230211010313 is an apocalyptic number.
It is an amenable number.
10230211010313 is a deficient number, since it is larger than the sum of its proper divisors (7010829242487).
10230211010313 is a wasteful number, since it uses less digits than its factorization.
10230211010313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36747 (or 36737 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 10230211010313 its reverse (31301011203201), we get a palindrome (41531222213514).
The spelling of 10230211010313 in words is "ten trillion, two hundred thirty billion, two hundred eleven million, ten thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •