Base | Representation |
---|---|
bin | 11101100101101101000110… |
… | …101111110011111101011110 |
3 | 122001202201122011021112121100 |
4 | 131211231012233303331132 |
5 | 114024110223131241342 |
6 | 1140434530222413530 |
7 | 36260620525536045 |
oct | 3545550657637536 |
9 | 561681564245540 |
10 | 130134401040222 |
11 | 38512764876a87 |
12 | 12718b037312a6 |
13 | 577c810195317 |
14 | 241c777d7355c |
15 | 100a16399de4c |
hex | 765b46bf3f5e |
130134401040222 has 24 divisors (see below), whose sum is σ = 291680554056840. Its totient is φ = 41882335966800.
The previous prime is 130134401040211. The next prime is 130134401040389. The reversal of 130134401040222 is 222040104431031.
130134401040222 is a `hidden beast` number, since 1 + 3 + 0 + 1 + 34 + 401 + 0 + 4 + 0 + 222 = 666.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 124649808904 + ... + 124649809947.
It is an arithmetic number, because the mean of its divisors is an integer number (12153356419035).
Almost surely, 2130134401040222 is an apocalyptic number.
130134401040222 is an abundant number, since it is smaller than the sum of its proper divisors (161546153016618).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130134401040222 is a wasteful number, since it uses less digits than its factorization.
130134401040222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 249299618888 (or 249299618885 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 130134401040222 its reverse (222040104431031), we get a palindrome (352174505471253).
The spelling of 130134401040222 in words is "one hundred thirty trillion, one hundred thirty-four billion, four hundred one million, forty thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •