Base | Representation |
---|---|
bin | 10111000010011100101011… |
… | …010011110111111101111011 |
3 | 111021202102010222221012220102 |
4 | 113002130223103313331323 |
5 | 101240040104312011303 |
6 | 555255140444350015 |
7 | 30225236555402243 |
oct | 2702345323677573 |
9 | 437672128835812 |
10 | 101323300110203 |
11 | 2a314a74467a96 |
12 | b44517424530b |
13 | 446c991538532 |
14 | 1b04106a8ab23 |
15 | baa9b9036288 |
hex | 5c272b4f7f7b |
101323300110203 has 4 divisors (see below), whose sum is σ = 101323334534688. Its totient is φ = 101323265685720.
The previous prime is 101323300110173. The next prime is 101323300110209. The reversal of 101323300110203 is 302011003323101.
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 101323300110203 - 238 = 101048422203259 is a prime.
It is a super-2 number, since 2×1013233001102032 (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 (101323300110209) 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, 12336908 + ... + 18837353.
It is an arithmetic number, because the mean of its divisors is an integer number (25330833633672).
Almost surely, 2101323300110203 is an apocalyptic number.
101323300110203 is a deficient number, since it is larger than the sum of its proper divisors (34424485).
101323300110203 is an equidigital number, since it uses as much as digits as its factorization.
101323300110203 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34424484.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 101323300110203 its reverse (302011003323101), we get a palindrome (403334303433304).
The spelling of 101323300110203 in words is "one hundred one trillion, three hundred twenty-three billion, three hundred million, one hundred ten thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •