Base | Representation |
---|---|
bin | 100110000011100110110… |
… | …1000111001100110110111 |
3 | 200112000122022212122221021 |
4 | 1030013031220321212313 |
5 | 1141143402331001411 |
6 | 15042454005202011 |
7 | 1046612546033446 |
oct | 114071550714667 |
9 | 20460568778837 |
10 | 5230425250231 |
11 | 1737235773565 |
12 | 705836a00307 |
13 | 2bc2c48bab8c |
14 | 14122256ad5d |
15 | 910c6cbea71 |
hex | 4c1cda399b7 |
5230425250231 has 8 divisors (see below), whose sum is σ = 5666890285584. Its totient is φ = 4808270544000.
The previous prime is 5230425250207. The next prime is 5230425250243. The reversal of 5230425250231 is 1320525240325.
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 5230425250231 - 227 = 5230291032503 is a prime.
It is a super-2 number, since 2×52304252502312 (a number of 26 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 (5230425250261) 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, 3577581520 + ... + 3577582981.
It is an arithmetic number, because the mean of its divisors is an integer number (708361285698).
Almost surely, 25230425250231 is an apocalyptic number.
5230425250231 is a deficient number, since it is larger than the sum of its proper divisors (436465035353).
5230425250231 is a wasteful number, since it uses less digits than its factorization.
5230425250231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7155164561.
The product of its (nonzero) digits is 72000, while the sum is 34.
The spelling of 5230425250231 in words is "five trillion, two hundred thirty billion, four hundred twenty-five million, two hundred fifty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •