Base | Representation |
---|---|
bin | 1101011010110110001… |
… | …0011110001010000101 |
3 | 211001002001122100010112 |
4 | 3112231202132022011 |
5 | 12234123424331402 |
6 | 253524422202405 |
7 | 22441054065512 |
oct | 3265542361205 |
9 | 731061570115 |
10 | 230544761477 |
11 | 89856564628 |
12 | 38820b83405 |
13 | 1898150c234 |
14 | b230a14309 |
15 | 5ee4d08e52 |
hex | 35ad89e285 |
230544761477 has 8 divisors (see below), whose sum is σ = 235478438400. Its totient is φ = 225612270864.
The previous prime is 230544761437. The next prime is 230544761539. The reversal of 230544761477 is 774167445032.
230544761477 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 230544761477 - 28 = 230544761221 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 (230544761437) 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, 101924 + ... + 686642.
It is an arithmetic number, because the mean of its divisors is an integer number (29434804800).
Almost surely, 2230544761477 is an apocalyptic number.
It is an amenable number.
230544761477 is a deficient number, since it is larger than the sum of its proper divisors (4933676923).
230544761477 is an equidigital number, since it uses as much as digits as its factorization.
230544761477 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 593155.
The product of its (nonzero) digits is 3951360, while the sum is 50.
The spelling of 230544761477 in words is "two hundred thirty billion, five hundred forty-four million, seven hundred sixty-one thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •