Base | Representation |
---|---|
bin | 10111001110001110111110… |
… | …111101110100111010010010 |
3 | 111101121211201111012002212212 |
4 | 113032032332331310322102 |
5 | 101341322324142211010 |
6 | 1001115205250552122 |
7 | 30340611452223341 |
oct | 2716167675647222 |
9 | 441554644162785 |
10 | 102133231210130 |
11 | 2a5a750745708a |
12 | b556130598642 |
13 | 44cb178b2a3a3 |
14 | 1b313bbd5bb58 |
15 | bc1abe126505 |
hex | 5ce3bef74e92 |
102133231210130 has 16 divisors (see below), whose sum is σ = 190179120184920. Its totient is φ = 39444558260352.
The previous prime is 102133231210111. The next prime is 102133231210177. The reversal of 102133231210130 is 31012132331201.
It can be written as a sum of positive squares in 4 ways, for example, as 78341634868561 + 23791596341569 = 8851081^2 + 4877663^2 .
It is a junction number, because it is equal to n+sod(n) for n = 102133231210096 and 102133231210105.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 176091777659 + ... + 176091778238.
Almost surely, 2102133231210130 is an apocalyptic number.
102133231210130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102133231210130 is a deficient number, since it is larger than the sum of its proper divisors (88045888974790).
102133231210130 is a wasteful number, since it uses less digits than its factorization.
102133231210130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 352183555933.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 102133231210130 its reverse (31012132331201), we get a palindrome (133145363541331).
The spelling of 102133231210130 in words is "one hundred two trillion, one hundred thirty-three billion, two hundred thirty-one million, two hundred ten thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •