Base | Representation |
---|---|
bin | 111010011000001001… |
… | …0111001110010001111 |
3 | 102222120212001221212021 |
4 | 1310300102321302033 |
5 | 4023221231010411 |
6 | 133331440151011 |
7 | 12025434036403 |
oct | 1646022716217 |
9 | 388525057767 |
10 | 125364313231 |
11 | 49191983043 |
12 | 20368308467 |
13 | ba8b671001 |
14 | 60d395d103 |
15 | 33dadc1a71 |
hex | 1d304b9c8f |
125364313231 has 8 divisors (see below), whose sum is σ = 131966081280. Its totient is φ = 118762909848.
The previous prime is 125364313229. The next prime is 125364313247. The reversal of 125364313231 is 132313463521.
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 125364313231 - 21 = 125364313229 is a prime.
It is a super-2 number, since 2×1253643132312 (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 (125364313201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 879690 + ... + 1012216.
It is an arithmetic number, because the mean of its divisors is an integer number (16495760160).
Almost surely, 2125364313231 is an apocalyptic number.
125364313231 is a deficient number, since it is larger than the sum of its proper divisors (6601768049).
125364313231 is a wasteful number, since it uses less digits than its factorization.
125364313231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 182333.
The product of its digits is 38880, while the sum is 34.
Adding to 125364313231 its reverse (132313463521), we get a palindrome (257677776752).
The spelling of 125364313231 in words is "one hundred twenty-five billion, three hundred sixty-four million, three hundred thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •