Base | Representation |
---|---|
bin | 1101011001010010101… |
… | …0000101011101010101 |
3 | 210222222222011110202121 |
4 | 3112110222011131111 |
5 | 12232300043431221 |
6 | 253415151135541 |
7 | 22424525001532 |
oct | 3262452053525 |
9 | 728888143677 |
10 | 230127327061 |
11 | 89661970a05 |
12 | 387252145b1 |
13 | 18915ba5218 |
14 | b1d13d1d89 |
15 | 5ebd34ea41 |
hex | 3594a85755 |
230127327061 has 8 divisors (see below), whose sum is σ = 231683160384. Its totient is φ = 228576724320.
The previous prime is 230127327041. The next prime is 230127327107. The reversal of 230127327061 is 160723721032.
230127327061 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 a de Polignac number, because none of the positive numbers 2k-230127327061 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 (230127327041) 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, 1219336 + ... + 1395361.
It is an arithmetic number, because the mean of its divisors is an integer number (28960395048).
Almost surely, 2230127327061 is an apocalyptic number.
It is an amenable number.
230127327061 is a deficient number, since it is larger than the sum of its proper divisors (1555833323).
230127327061 is a wasteful number, since it uses less digits than its factorization.
230127327061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2615291.
The product of its (nonzero) digits is 21168, while the sum is 34.
The spelling of 230127327061 in words is "two hundred thirty billion, one hundred twenty-seven million, three hundred twenty-seven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •