Base | Representation |
---|---|
bin | 10111000010010001011011… |
… | …111011111101000100001011 |
3 | 111021201020222212210222102120 |
4 | 113002101123323331010023 |
5 | 101234340400120140243 |
6 | 555245423110102323 |
7 | 30224331515005221 |
oct | 2702213373750413 |
9 | 437636885728376 |
10 | 101311231021323 |
11 | 2a30a940807974 |
12 | b44296634a9a3 |
13 | 446b7b9c93b1b |
14 | 1b036bdc06b11 |
15 | baa50e6b9c83 |
hex | 5c245befd10b |
101311231021323 has 4 divisors (see below), whose sum is σ = 135081641361768. Its totient is φ = 67540820680880.
The previous prime is 101311231021243. The next prime is 101311231021391. The reversal of 101311231021323 is 323120132113101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 101311231021323 - 241 = 99112207765771 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101311231021293 and 101311231021302.
It is not an unprimeable number, because it can be changed into a prime (101311231021423) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16885205170218 + ... + 16885205170223.
It is an arithmetic number, because the mean of its divisors is an integer number (33770410340442).
Almost surely, 2101311231021323 is an apocalyptic number.
101311231021323 is a deficient number, since it is larger than the sum of its proper divisors (33770410340445).
101311231021323 is an equidigital number, since it uses as much as digits as its factorization.
101311231021323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33770410340444.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 101311231021323 its reverse (323120132113101), we get a palindrome (424431363134424).
The spelling of 101311231021323 in words is "one hundred one trillion, three hundred eleven billion, two hundred thirty-one million, twenty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •