Base | Representation |
---|---|
bin | 10111010000101010010011… |
… | …111011110111011010001011 |
3 | 111102012210012210112220002122 |
4 | 113100222103323313122023 |
5 | 101402040411312002311 |
6 | 1001323551023321455 |
7 | 30355634455106546 |
oct | 2720522373673213 |
9 | 442183183486078 |
10 | 102300013000331 |
11 | 2a661212423633 |
12 | b58251745028b |
13 | 4510b0810b303 |
14 | 1b394c042985d |
15 | bc60d11780db |
hex | 5d0a93ef768b |
102300013000331 has 8 divisors (see below), whose sum is σ = 102390740897760. Its totient is φ = 102209324496832.
The previous prime is 102300013000291. The next prime is 102300013000337. The reversal of 102300013000331 is 133000310003201.
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 102300013000331 - 210 = 102300012999307 is a prime.
It is a super-2 number, since 2×1023000130003312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102300013000337) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4651271 + ... + 15041088.
It is an arithmetic number, because the mean of its divisors is an integer number (12798842612220).
Almost surely, 2102300013000331 is an apocalyptic number.
102300013000331 is a deficient number, since it is larger than the sum of its proper divisors (90727897429).
102300013000331 is a wasteful number, since it uses less digits than its factorization.
102300013000331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19696965.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 102300013000331 its reverse (133000310003201), we get a palindrome (235300323003532).
The spelling of 102300013000331 in words is "one hundred two trillion, three hundred billion, thirteen million, three hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •