Base | Representation |
---|---|
bin | 11101100100001100110011… |
… | …101000011101111111001000 |
3 | 122001101211202001010000102221 |
4 | 131210030303220131333020 |
5 | 114020411442242224000 |
6 | 1140315230043503424 |
7 | 36250300266040432 |
oct | 3544146350357710 |
9 | 561354661100387 |
10 | 130031001133000 |
11 | 38482924269300 |
12 | 12700a67227b74 |
13 | 5772b42193076 |
14 | 241776956b652 |
15 | 100761102961a |
hex | 764333a1dfc8 |
130031001133000 has 96 divisors (see below), whose sum is σ = 334448332316280. Its totient is φ = 47284000368000.
The previous prime is 130031001132997. The next prime is 130031001133097. The reversal of 130031001133000 is 331100130031.
It can be written as a sum of positive squares in 4 ways, for example, as 5414547378724 + 124616453754276 = 2326918^2 + 11163174^2 .
It is a super-2 number, since 2×1300310011330002 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 537197187 + ... + 537439186.
Almost surely, 2130031001133000 is an apocalyptic number.
130031001133000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130031001133000 is an abundant number, since it is smaller than the sum of its proper divisors (204417331183280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130031001133000 is a wasteful number, since it uses less digits than its factorization.
130031001133000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1074636416 (or 1074636391 counting only the distinct ones).
The product of its (nonzero) digits is 81, while the sum is 16.
Adding to 130031001133000 its reverse (331100130031), we get a palindrome (130362101263031).
The spelling of 130031001133000 in words is "one hundred thirty trillion, thirty-one billion, one million, one hundred thirty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •