Base | Representation |
---|---|
bin | 10111000010100011001000… |
… | …011111010111000001101101 |
3 | 111021210002001002201100121120 |
4 | 113002203020133113001231 |
5 | 101240143303410024323 |
6 | 555302244353251153 |
7 | 30225603420420600 |
oct | 2702431037270155 |
9 | 437702032640546 |
10 | 101330232111213 |
11 | 2a317a01397a46 |
12 | b446589863ab9 |
13 | 4470527723691 |
14 | 1b045a3586337 |
15 | baac728bc5e3 |
hex | 5c28c87d706d |
101330232111213 has 48 divisors (see below), whose sum is σ = 161049146987520. Its totient is φ = 56487066636000.
The previous prime is 101330232111191. The next prime is 101330232111221. The reversal of 101330232111213 is 312111232033101.
It is not a de Polignac number, because 101330232111213 - 240 = 100230720483437 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101330232111013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 43457013 + ... + 45729338.
It is an arithmetic number, because the mean of its divisors is an integer number (3355190562240).
Almost surely, 2101330232111213 is an apocalyptic number.
It is an amenable number.
101330232111213 is a deficient number, since it is larger than the sum of its proper divisors (59718914876307).
101330232111213 is a wasteful number, since it uses less digits than its factorization.
101330232111213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89186558 (or 89186551 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 101330232111213 its reverse (312111232033101), we get a palindrome (413441464144314).
The spelling of 101330232111213 in words is "one hundred one trillion, three hundred thirty billion, two hundred thirty-two million, one hundred eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •