Base | Representation |
---|---|
bin | 10111000010011001111001… |
… | …101100110100000000010011 |
3 | 111021202010110022220100001020 |
4 | 113002121321230310000103 |
5 | 101240013003444144443 |
6 | 555253525041010523 |
7 | 30225102663431115 |
oct | 2702317154640023 |
9 | 437663408810036 |
10 | 101320320303123 |
11 | 2a313785439909 |
12 | b444682323a43 |
13 | 446c6080a418c |
14 | 1b03d0301d3b5 |
15 | baa892630583 |
hex | 5c2679b34013 |
101320320303123 has 8 divisors (see below), whose sum is σ = 139451623643136. Its totient is φ = 65367948582600.
The previous prime is 101320320303101. The next prime is 101320320303157. The reversal of 101320320303123 is 321303023023101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101320320303123 - 25 = 101320320303091 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101320320303093 and 101320320303102.
It is not an unprimeable number, because it can be changed into a prime (101320320303623) 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, 544732904763 + ... + 544732904948.
It is an arithmetic number, because the mean of its divisors is an integer number (17431452955392).
Almost surely, 2101320320303123 is an apocalyptic number.
101320320303123 is a deficient number, since it is larger than the sum of its proper divisors (38131303340013).
101320320303123 is a wasteful number, since it uses less digits than its factorization.
101320320303123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1089465809745.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 101320320303123 its reverse (321303023023101), we get a palindrome (422623343326224).
The spelling of 101320320303123 in words is "one hundred one trillion, three hundred twenty billion, three hundred twenty million, three hundred three thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •