Base | Representation |
---|---|
bin | 10111010001000110010000… |
… | …000001000000011010010010 |
3 | 111102022122122110222111011122 |
4 | 113101012100001000122102 |
5 | 101403033331033311010 |
6 | 1001345431502242242 |
7 | 30361046043352532 |
oct | 2721062001003222 |
9 | 442278573874148 |
10 | 102330012010130 |
11 | 2a672a07050713 |
12 | b5882a9b86382 |
13 | 45138a9217798 |
14 | 1b3ab286974c2 |
15 | bc6c89b58855 |
hex | 5d1190040692 |
102330012010130 has 8 divisors (see below), whose sum is σ = 184194021618252. Its totient is φ = 40932004804048.
The previous prime is 102330012010087. The next prime is 102330012010139. The reversal of 102330012010130 is 31010210033201.
It can be written as a sum of positive squares in 2 ways, for example, as 95311502343121 + 7018509667009 = 9762761^2 + 2649247^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 = 102330012010099 and 102330012010108.
It is not an unprimeable number, because it can be changed into a prime (102330012010139) 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, 5116500600497 + ... + 5116500600516.
Almost surely, 2102330012010130 is an apocalyptic number.
102330012010130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102330012010130 is a deficient number, since it is larger than the sum of its proper divisors (81864009608122).
102330012010130 is a wasteful number, since it uses less digits than its factorization.
102330012010130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10233001201020.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 102330012010130 its reverse (31010210033201), we get a palindrome (133340222043331).
The spelling of 102330012010130 in words is "one hundred two trillion, three hundred thirty billion, twelve million, ten thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •