Base | Representation |
---|---|
bin | 110100010100110000011100… |
… | …100010010101111011100101 |
3 | 1010011210201101211101020112102 |
4 | 310110300130202111323211 |
5 | 220130331121040000303 |
6 | 2133233515201301445 |
7 | 66320653504433465 |
oct | 6424603442257345 |
9 | 1104721354336472 |
10 | 230124826484453 |
11 | 6736343323274a |
12 | 21987896934885 |
13 | 9b538a7800844 |
14 | 40b815b32bba5 |
15 | 1b9111c8ed288 |
hex | d14c1c895ee5 |
230124826484453 has 8 divisors (see below), whose sum is σ = 230875435670880. Its totient is φ = 229374223902000.
The previous prime is 230124826484447. The next prime is 230124826484461. The reversal of 230124826484453 is 354484628421032.
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 230124826484453 - 216 = 230124826418917 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230124826484053) 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, 73763843 + ... + 76820271.
It is an arithmetic number, because the mean of its divisors is an integer number (28859429458860).
Almost surely, 2230124826484453 is an apocalyptic number.
It is an amenable number.
230124826484453 is a deficient number, since it is larger than the sum of its proper divisors (750609186427).
230124826484453 is a wasteful number, since it uses less digits than its factorization.
230124826484453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3301987.
The product of its (nonzero) digits is 35389440, while the sum is 56.
The spelling of 230124826484453 in words is "two hundred thirty trillion, one hundred twenty-four billion, eight hundred twenty-six million, four hundred eighty-four thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •