Base | Representation |
---|---|
bin | 11101110011110000011001… |
… | …000000100110100000100001 |
3 | 122012012001000111120200121111 |
4 | 131303300121000212200201 |
5 | 114140420300320044413 |
6 | 1142454301552023321 |
7 | 36420443150562244 |
oct | 3563603100464041 |
9 | 565161014520544 |
10 | 131100001331233 |
11 | 3885521aa88410 |
12 | 12854085231b41 |
13 | 581c8a570836c |
14 | 24533b98d125b |
15 | 102532a20dd3d |
hex | 773c19026821 |
131100001331233 has 16 divisors (see below), whose sum is σ = 148454793144000. Its totient is φ = 114679363852480.
The previous prime is 131100001331209. The next prime is 131100001331237. The reversal of 131100001331233 is 332133100001131.
It is a cyclic number.
It is not a de Polignac number, because 131100001331233 - 233 = 131091411396641 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131100001331237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 701223583 + ... + 701410516.
It is an arithmetic number, because the mean of its divisors is an integer number (9278424571500).
Almost surely, 2131100001331233 is an apocalyptic number.
It is an amenable number.
131100001331233 is a deficient number, since it is larger than the sum of its proper divisors (17354791812767).
131100001331233 is a wasteful number, since it uses less digits than its factorization.
131100001331233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1402634432.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 131100001331233 its reverse (332133100001131), we get a palindrome (463233101332364).
The spelling of 131100001331233 in words is "one hundred thirty-one trillion, one hundred billion, one million, three hundred thirty-one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •