Base | Representation |
---|---|
bin | 10110111101111001000111… |
… | …000100001000010001100011 |
3 | 111020122111001211011221001111 |
4 | 112331321013010020101203 |
5 | 101214422424140212011 |
6 | 554455243244444151 |
7 | 30163514512112611 |
oct | 2675710704102143 |
9 | 436574054157044 |
10 | 101010233132131 |
11 | 2a2042212a9764 |
12 | b3b4562849657 |
13 | 44492bb4b6a4b |
14 | 1ad2cc83466b1 |
15 | ba27945e5121 |
hex | 5bde47108463 |
101010233132131 has 4 divisors (see below), whose sum is σ = 101010281633272. Its totient is φ = 101010184630992.
The previous prime is 101010233132063. The next prime is 101010233132147. The reversal of 101010233132131 is 131231332010101.
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 101010233132131 - 223 = 101010224743523 is a prime.
It is a super-2 number, since 2×1010102331321312 (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 (101010233139131) 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, 20979546 + ... + 25340911.
It is an arithmetic number, because the mean of its divisors is an integer number (25252570408318).
Almost surely, 2101010233132131 is an apocalyptic number.
101010233132131 is a deficient number, since it is larger than the sum of its proper divisors (48501141).
101010233132131 is an equidigital number, since it uses as much as digits as its factorization.
101010233132131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48501140.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 101010233132131 its reverse (131231332010101), we get a palindrome (232241565142232).
The spelling of 101010233132131 in words is "one hundred one trillion, ten billion, two hundred thirty-three million, one hundred thirty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.771 sec. • engine limits •