Base | Representation |
---|---|
bin | 11100011011011011110000… |
… | …010110000101111101111101 |
3 | 121101200210122122001121022100 |
4 | 130123123300112011331331 |
5 | 112342000011224410023 |
6 | 1121530122131535313 |
7 | 35223105045251436 |
oct | 3433336026057575 |
9 | 541623578047270 |
10 | 125030530310013 |
11 | 36925171903539 |
12 | 1203390775a539 |
13 | 549c4366c1223 |
14 | 22c371d46648d |
15 | e6c4e7304c43 |
hex | 71b6f0585f7d |
125030530310013 has 24 divisors (see below), whose sum is σ = 186828628428000. Its totient is φ = 80478819064224.
The previous prime is 125030530309999. The next prime is 125030530310047. The reversal of 125030530310013 is 310013035030521.
125030530310013 is a `hidden beast` number, since 1 + 2 + 5 + 0 + 305 + 30 + 310 + 0 + 13 = 666.
It is not a de Polignac number, because 125030530310013 - 28 = 125030530309757 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125030530312013) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 34528206 + ... + 37977072.
It is an arithmetic number, because the mean of its divisors is an integer number (7784526184500).
Almost surely, 2125030530310013 is an apocalyptic number.
It is an amenable number.
125030530310013 is a deficient number, since it is larger than the sum of its proper divisors (61798098117987).
125030530310013 is a wasteful number, since it uses less digits than its factorization.
125030530310013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3587801 (or 3587798 counting only the distinct ones).
The product of its (nonzero) digits is 4050, while the sum is 27.
Adding to 125030530310013 its reverse (310013035030521), we get a palindrome (435043565340534).
The spelling of 125030530310013 in words is "one hundred twenty-five trillion, thirty billion, five hundred thirty million, three hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •