Base | Representation |
---|---|
bin | 1011111100011100110000… |
… | …1110010100110100010110 |
3 | 1201111111221012101221020010 |
4 | 2333013030032110310112 |
5 | 3210133133140044342 |
6 | 43533140513221050 |
7 | 2523560325264663 |
oct | 277071416246426 |
9 | 51444835357203 |
10 | 13133141331222 |
11 | 42038089a0530 |
12 | 158135a561786 |
13 | 7435b05c9703 |
14 | 33590c7a6a6a |
15 | 17b9531aa29c |
hex | bf1cc394d16 |
13133141331222 has 64 divisors (see below), whose sum is σ = 31318362298368. Its totient is φ = 3624810432000.
The previous prime is 13133141331071. The next prime is 13133141331223. The reversal of 13133141331222 is 22213314133131.
It is a self number, because there is not a number n which added to its sum of digits gives 13133141331222.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13133141331223) 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 31 ways as a sum of consecutive naturals, for example, 188757429 + ... + 188826992.
It is an arithmetic number, because the mean of its divisors is an integer number (489349410912).
Almost surely, 213133141331222 is an apocalyptic number.
13133141331222 is an abundant number, since it is smaller than the sum of its proper divisors (18185220967146).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13133141331222 is a wasteful number, since it uses less digits than its factorization.
13133141331222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 377584485.
The product of its digits is 7776, while the sum is 30.
Adding to 13133141331222 its reverse (22213314133131), we get a palindrome (35346455464353).
The spelling of 13133141331222 in words is "thirteen trillion, one hundred thirty-three billion, one hundred forty-one million, three hundred thirty-one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •