Base | Representation |
---|---|
bin | 1011000010000100001011… |
… | …1101011000010000110010 |
3 | 1120221121221021221021101102 |
4 | 2300201002331120100302 |
5 | 3042214431410432242 |
6 | 41444255053004402 |
7 | 2361241313352305 |
oct | 260410275302062 |
9 | 46847837837342 |
10 | 12130111030322 |
11 | 395739549972a |
12 | 143aa91783702 |
13 | 69cb3159a71c |
14 | 2dd159b0ab3c |
15 | 1607ea8b6e32 |
hex | b0842f58432 |
12130111030322 has 8 divisors (see below), whose sum is σ = 18237187716636. Its totient is φ = 6051048458112.
The previous prime is 12130111030321. The next prime is 12130111030339. The reversal of 12130111030322 is 22303011103121.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 12129401287441 + 709742881 = 3482729^2 + 26641^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 12130111030294 and 12130111030303.
It is not an unprimeable number, because it can be changed into a prime (12130111030321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7003527443 + ... + 7003529174.
Almost surely, 212130111030322 is an apocalyptic number.
12130111030322 is a deficient number, since it is larger than the sum of its proper divisors (6107076686314).
12130111030322 is a wasteful number, since it uses less digits than its factorization.
12130111030322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14007057052.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 12130111030322 its reverse (22303011103121), we get a palindrome (34433122133443).
The spelling of 12130111030322 in words is "twelve trillion, one hundred thirty billion, one hundred eleven million, thirty thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •