Base | Representation |
---|---|
bin | 10110111111101001110001… |
… | …110111000110111001100011 |
3 | 111021002001022220220220112011 |
4 | 112333221301313012321203 |
5 | 101223413204304120303 |
6 | 555031011523413351 |
7 | 30205326444323206 |
oct | 2677516167067143 |
9 | 437061286826464 |
10 | 101131210223203 |
11 | 2a25056175a866 |
12 | b413aa5824257 |
13 | 445782ac49ac4 |
14 | 1ad8ac335593d |
15 | ba59c525416d |
hex | 5bfa71dc6e63 |
101131210223203 has 8 divisors (see below), whose sum is σ = 101223230101200. Its totient is φ = 101039232150528.
The previous prime is 101131210223201. The next prime is 101131210223261. The reversal of 101131210223203 is 302322012131101.
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 101131210223203 - 21 = 101131210223201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101131210223201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5609913 + ... + 15288346.
It is an arithmetic number, because the mean of its divisors is an integer number (12652903762650).
Almost surely, 2101131210223203 is an apocalyptic number.
101131210223203 is a deficient number, since it is larger than the sum of its proper divisors (92019877997).
101131210223203 is a wasteful number, since it uses less digits than its factorization.
101131210223203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20902661.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 101131210223203 its reverse (302322012131101), we get a palindrome (403453222354304).
The spelling of 101131210223203 in words is "one hundred one trillion, one hundred thirty-one billion, two hundred ten million, two hundred twenty-three thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •