Base | Representation |
---|---|
bin | 11101100110110011100011… |
… | …011110110111011101011011 |
3 | 122002000221212220212011000120 |
4 | 131212303203132313131123 |
5 | 114031330133014040201 |
6 | 1140533400252404323 |
7 | 36266236205252430 |
oct | 3546634336673533 |
9 | 562027786764016 |
10 | 130210045065051 |
11 | 38541851963486 |
12 | 1272b6b47766a3 |
13 | 57869a6a0c923 |
14 | 24222b23b3b87 |
15 | 100c0de82d536 |
hex | 766ce37b775b |
130210045065051 has 32 divisors (see below), whose sum is σ = 199828459192320. Its totient is φ = 73876812509856.
The previous prime is 130210045064999. The next prime is 130210045065059. The reversal of 130210045065051 is 150560540012031.
It is not a de Polignac number, because 130210045065051 - 214 = 130210045048667 is a prime.
It is a super-2 number, since 2×1302100450650512 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (130210045065059) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 17818611 + ... + 24040028.
It is an arithmetic number, because the mean of its divisors is an integer number (6244639349760).
Almost surely, 2130210045065051 is an apocalyptic number.
130210045065051 is a deficient number, since it is larger than the sum of its proper divisors (69618414127269).
130210045065051 is a wasteful number, since it uses less digits than its factorization.
130210045065051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41859703.
The product of its (nonzero) digits is 18000, while the sum is 33.
Adding to 130210045065051 its reverse (150560540012031), we get a palindrome (280770585077082).
The spelling of 130210045065051 in words is "one hundred thirty trillion, two hundred ten billion, forty-five million, sixty-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •