Base | Representation |
---|---|
bin | 111010001101101011… |
… | …1111011101101011101 |
3 | 102221200101121011100202 |
4 | 1310123113323231131 |
5 | 4022011401412201 |
6 | 133232541033245 |
7 | 12013642414265 |
oct | 1643327735535 |
9 | 387611534322 |
10 | 125013310301 |
11 | 49021833380 |
12 | 2028a855825 |
13 | ba33a26479 |
14 | 609d0b07a5 |
15 | 33ba18ac6b |
hex | 1d1b5fbb5d |
125013310301 has 8 divisors (see below), whose sum is σ = 138413652384. Its totient is φ = 111952217520.
The previous prime is 125013310283. The next prime is 125013310307. The reversal of 125013310301 is 103013310521.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 125013310301 - 222 = 125009115997 is a prime.
It is a super-2 number, since 2×1250133103012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125013310307) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 84811550 + ... + 84813023.
It is an arithmetic number, because the mean of its divisors is an integer number (17301706548).
Almost surely, 2125013310301 is an apocalyptic number.
125013310301 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
125013310301 is a deficient number, since it is larger than the sum of its proper divisors (13400342083).
125013310301 is a wasteful number, since it uses less digits than its factorization.
125013310301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 169624651.
The product of its (nonzero) digits is 270, while the sum is 20.
Adding to 125013310301 its reverse (103013310521), we get a palindrome (228026620822).
The spelling of 125013310301 in words is "one hundred twenty-five billion, thirteen million, three hundred ten thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •