Base | Representation |
---|---|
bin | 11101100110110011100010… |
… | …000000011001010101010000 |
3 | 122002000221211012020221220121 |
4 | 131212303202000121111100 |
5 | 114031330110144100422 |
6 | 1140533354005520024 |
7 | 36266235454616434 |
oct | 3546634200312520 |
9 | 562027735227817 |
10 | 130210020300112 |
11 | 38541839989195 |
12 | 1272b6a8413014 |
13 | 57869a184b70c |
14 | 24222acda89c4 |
15 | 100c0dc58a8c7 |
hex | 766ce2019550 |
130210020300112 has 10 divisors (see below), whose sum is σ = 252281914331498. Its totient is φ = 65105010150048.
The previous prime is 130210020300109. The next prime is 130210020300131. The reversal of 130210020300112 is 211003020012031.
It can be written as a sum of positive squares in only one way, i.e., 70299571946256 + 59910448353856 = 8384484^2 + 7740184^2 .
It is a Harshad number since it is a multiple of its sum of digits (16), and also a Moran number because the ratio is a prime number: 8138126268757 = 130210020300112 / (1 + 3 + 0 + 2 + 1 + 0 + 0 + 2 + 0 + 3 + 0 + 0 + 1 + 1 + 2).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4069063134363 + ... + 4069063134394.
Almost surely, 2130210020300112 is an apocalyptic number.
It is an amenable number.
130210020300112 is a deficient number, since it is larger than the sum of its proper divisors (122071894031386).
130210020300112 is an equidigital number, since it uses as much as digits as its factorization.
130210020300112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8138126268765 (or 8138126268759 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 130210020300112 its reverse (211003020012031), we get a palindrome (341213040312143).
The spelling of 130210020300112 in words is "one hundred thirty trillion, two hundred ten billion, twenty million, three hundred thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •