Base | Representation |
---|---|
bin | 10111010000101010011001… |
… | …110101111001111110110101 |
3 | 111102012210110201000202001221 |
4 | 113100222121311321332311 |
5 | 101402041112144220201 |
6 | 1001324004523350341 |
7 | 30355640100335632 |
oct | 2720523165717665 |
9 | 442183421022057 |
10 | 102300112101301 |
11 | 2a661263360664 |
12 | b5825446823b1 |
13 | 4510b227c883a |
14 | 1b394cd665189 |
15 | bc60d9c014a1 |
hex | 5d0a99d79fb5 |
102300112101301 has 8 divisors (see below), whose sum is σ = 105601105131008. Its totient is φ = 98999180910000.
The previous prime is 102300112101241. The next prime is 102300112101337. The reversal of 102300112101301 is 103101211003201.
It is a happy number.
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 102300112101301 - 215 = 102300112068533 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102300112141301) 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, 12085905 + ... + 18726166.
It is an arithmetic number, because the mean of its divisors is an integer number (13200138141376).
Almost surely, 2102300112101301 is an apocalyptic number.
It is an amenable number.
102300112101301 is a deficient number, since it is larger than the sum of its proper divisors (3300993029707).
102300112101301 is a wasteful number, since it uses less digits than its factorization.
102300112101301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30919203.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 102300112101301 its reverse (103101211003201), we get a palindrome (205401323104502).
The spelling of 102300112101301 in words is "one hundred two trillion, three hundred billion, one hundred twelve million, one hundred one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •