Base | Representation |
---|---|
bin | 11101100011110010010001… |
… | …000100101110100100111001 |
3 | 122001022010012000211020222111 |
4 | 131203302101010232210321 |
5 | 114014430112014113001 |
6 | 1140254154220252321 |
7 | 36245241145611631 |
oct | 3543622104564471 |
9 | 561263160736874 |
10 | 130002504051001 |
11 | 3847183041886a |
12 | 126b74336a10a1 |
13 | 57702502a247a |
14 | 24162249856c1 |
15 | 10069e4324851 |
hex | 763c9112e939 |
130002504051001 has 8 divisors (see below), whose sum is σ = 130020147815040. Its totient is φ = 129984860805552.
The previous prime is 130002504050989. The next prime is 130002504051011. The reversal of 130002504051001 is 100150405200031.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 130002504051001 - 213 = 130002504042809 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130002504051011) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 931894611 + ... + 932034103.
It is an arithmetic number, because the mean of its divisors is an integer number (16252518476880).
Almost surely, 2130002504051001 is an apocalyptic number.
It is an amenable number.
130002504051001 is a deficient number, since it is larger than the sum of its proper divisors (17643764039).
130002504051001 is a wasteful number, since it uses less digits than its factorization.
130002504051001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 259295.
The product of its (nonzero) digits is 600, while the sum is 22.
Adding to 130002504051001 its reverse (100150405200031), we get a palindrome (230152909251032).
The spelling of 130002504051001 in words is "one hundred thirty trillion, two billion, five hundred four million, fifty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •