Base | Representation |
---|---|
bin | 11101101000001001010000… |
… | …001100001111101010111001 |
3 | 122002100202101211020102000011 |
4 | 131220021100030033222321 |
5 | 114034332111140310431 |
6 | 1141043535204541521 |
7 | 36306004411515103 |
oct | 3550112014175271 |
9 | 562322354212004 |
10 | 130302063213241 |
11 | 38577881797137 |
12 | 127454b53b18a1 |
13 | 579257c99181a |
14 | 2426921332573 |
15 | 100e6c7e54cb1 |
hex | 76825030fab9 |
130302063213241 has 4 divisors (see below), whose sum is σ = 131455178817012. Its totient is φ = 129148947609472.
The previous prime is 130302063213197. The next prime is 130302063213271. The reversal of 130302063213241 is 142312360203031.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 48343805726841 + 81958257486400 = 6952971^2 + 9053080^2 .
It is a cyclic number.
It is not a de Polignac number, because 130302063213241 - 219 = 130302062688953 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130302063213271) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 576557801716 + ... + 576557801941.
It is an arithmetic number, because the mean of its divisors is an integer number (32863794704253).
Almost surely, 2130302063213241 is an apocalyptic number.
It is an amenable number.
130302063213241 is a deficient number, since it is larger than the sum of its proper divisors (1153115603771).
130302063213241 is a wasteful number, since it uses less digits than its factorization.
130302063213241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1153115603770.
The product of its (nonzero) digits is 15552, while the sum is 31.
The spelling of 130302063213241 in words is "one hundred thirty trillion, three hundred two billion, sixty-three million, two hundred thirteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •