Base | Representation |
---|---|
bin | 11101100011111001100011… |
… | …100111010100010010001000 |
3 | 122001022212101112011202102121 |
4 | 131203321203213110102020 |
5 | 114020042124303113000 |
6 | 1140301531025341024 |
7 | 36245636131260523 |
oct | 3543714347242210 |
9 | 561285345152377 |
10 | 130010331301000 |
11 | 38475087725617 |
12 | 126b8a58a97774 |
13 | 5770bc9aac647 |
14 | 2416768321bba |
15 | 1006d01599b1a |
hex | 763e639d4488 |
130010331301000 has 64 divisors (see below), whose sum is σ = 304228715384880. Its totient is φ = 52003356428800.
The previous prime is 130010331300973. The next prime is 130010331301051. The reversal of 130010331301000 is 103133010031.
It can be written as a sum of positive squares in 8 ways, for example, as 10660081340484 + 119350249960516 = 3264978^2 + 10924754^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 68561634 + ... + 70432366.
Almost surely, 2130010331301000 is an apocalyptic number.
130010331301000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130010331301000 is an abundant number, since it is smaller than the sum of its proper divisors (174218384083880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130010331301000 is a wasteful number, since it uses less digits than its factorization.
130010331301000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1940251 (or 1940237 counting only the distinct ones).
The product of its (nonzero) digits is 81, while the sum is 16.
Adding to 130010331301000 its reverse (103133010031), we get a palindrome (130113464311031).
The spelling of 130010331301000 in words is "one hundred thirty trillion, ten billion, three hundred thirty-one million, three hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •