Base | Representation |
---|---|
bin | 11101100100011111011101… |
… | …001111101111000010001101 |
3 | 122001110202102122122102202111 |
4 | 131210133131033233002031 |
5 | 114021224000310121013 |
6 | 1140332341124024021 |
7 | 36251606451061636 |
oct | 3544373517570215 |
9 | 561422378572674 |
10 | 130051026645133 |
11 | 38490370132a30 |
12 | 12704915832011 |
13 | 57749b3c31029 |
14 | 2418708db488d |
15 | 1007dd413473d |
hex | 7647dd3ef08d |
130051026645133 has 32 divisors (see below), whose sum is σ = 146910428380800. Its totient is φ = 114039128448000.
The previous prime is 130051026645119. The next prime is 130051026645247. The reversal of 130051026645133 is 331546620150031.
It is a cyclic number.
It is not a de Polignac number, because 130051026645133 - 245 = 94866654556301 is a prime.
It is a super-2 number, since 2×1300510266451332 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130051026645733) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1463291185 + ... + 1463380057.
It is an arithmetic number, because the mean of its divisors is an integer number (4590950886900).
Almost surely, 2130051026645133 is an apocalyptic number.
It is an amenable number.
130051026645133 is a deficient number, since it is larger than the sum of its proper divisors (16859401735667).
130051026645133 is a wasteful number, since it uses less digits than its factorization.
130051026645133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 93373.
The product of its (nonzero) digits is 194400, while the sum is 40.
Adding to 130051026645133 its reverse (331546620150031), we get a palindrome (461597646795164).
The spelling of 130051026645133 in words is "one hundred thirty trillion, fifty-one billion, twenty-six million, six hundred forty-five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •