Base | Representation |
---|---|
bin | 11101100110111000010010… |
… | …010010010001101011101111 |
3 | 122002001102222222010211210112 |
4 | 131212320102102101223233 |
5 | 114031421034031323124 |
6 | 1140540000330530235 |
7 | 36266506123230440 |
oct | 3546702222215357 |
9 | 562042888124715 |
10 | 130215125261039 |
11 | 38543a19565965 |
12 | 12730691b9697b |
13 | 5787306369b60 |
14 | 2422634d8d2c7 |
15 | 100c2da82690e |
hex | 766e12491aef |
130215125261039 has 32 divisors (see below), whose sum is σ = 161164080000000. Its totient is φ = 102449252139264.
The previous prime is 130215125261029. The next prime is 130215125261041. The reversal of 130215125261039 is 930162521512031.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130215125261039 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130215125260987 and 130215125261005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130215125261029) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 928386587 + ... + 928526835.
It is an arithmetic number, because the mean of its divisors is an integer number (5036377500000).
Almost surely, 2130215125261039 is an apocalyptic number.
130215125261039 is a deficient number, since it is larger than the sum of its proper divisors (30948954738961).
130215125261039 is a wasteful number, since it uses less digits than its factorization.
130215125261039 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 197447.
The product of its (nonzero) digits is 97200, while the sum is 41.
The spelling of 130215125261039 in words is "one hundred thirty trillion, two hundred fifteen billion, one hundred twenty-five million, two hundred sixty-one thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •