Base | Representation |
---|---|
bin | 101111001000000110… |
… | …0000010000100101010 |
3 | 100200020000220101111222 |
4 | 1132100030002010222 |
5 | 3124231022234010 |
6 | 114254150222042 |
7 | 10211625015242 |
oct | 1362014020452 |
9 | 320200811458 |
10 | 101203321130 |
11 | 39a1370007a |
12 | 17744954922 |
13 | 970abc7792 |
14 | 4c80bb6b22 |
15 | 2974bce355 |
hex | 179030212a |
101203321130 has 8 divisors (see below), whose sum is σ = 182165978052. Its totient is φ = 40481328448.
The previous prime is 101203321073. The next prime is 101203321199. The reversal of 101203321130 is 31123302101.
It can be written as a sum of positive squares in 2 ways, for example, as 100907240281 + 296080849 = 317659^2 + 17207^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1012033211302 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101203321099 and 101203321108.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5060166047 + ... + 5060166066.
Almost surely, 2101203321130 is an apocalyptic number.
101203321130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101203321130 is a deficient number, since it is larger than the sum of its proper divisors (80962656922).
101203321130 is a wasteful number, since it uses less digits than its factorization.
101203321130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10120332120.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 101203321130 its reverse (31123302101), we get a palindrome (132326623231).
The spelling of 101203321130 in words is "one hundred one billion, two hundred three million, three hundred twenty-one thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •