Base | Representation |
---|---|
bin | 1101011001010110111… |
… | …0110110000101110111 |
3 | 211000001020002020101222 |
4 | 3112111232312011313 |
5 | 12232314202231210 |
6 | 253421033340555 |
7 | 22425134133533 |
oct | 3262556660567 |
9 | 730036066358 |
10 | 230145352055 |
11 | 896710623a3 |
12 | 3872b26775b |
13 | 189198466b8 |
14 | b1d3964bc3 |
15 | 5ebec10655 |
hex | 3595bb6177 |
230145352055 has 8 divisors (see below), whose sum is σ = 276251523072. Its totient is φ = 184064881248.
The previous prime is 230145352051. The next prime is 230145352069. The reversal of 230145352055 is 550253541032.
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 230145352055 - 22 = 230145352051 is a prime.
It is a super-3 number, since 3×2301453520553 (a number of 35 digits) contains 333 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 (230145352051) 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, 6405344 + ... + 6441173.
It is an arithmetic number, because the mean of its divisors is an integer number (34531440384).
Almost surely, 2230145352055 is an apocalyptic number.
230145352055 is a deficient number, since it is larger than the sum of its proper divisors (46106171017).
230145352055 is a wasteful number, since it uses less digits than its factorization.
230145352055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12850105.
The product of its (nonzero) digits is 90000, while the sum is 35.
Adding to 230145352055 its reverse (550253541032), we get a palindrome (780398893087).
The spelling of 230145352055 in words is "two hundred thirty billion, one hundred forty-five million, three hundred fifty-two thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •