Base | Representation |
---|---|
bin | 1101011001010011110… |
… | …0110000000011000101 |
3 | 211000000022101001202022 |
4 | 3112110330300003011 |
5 | 12232302322020401 |
6 | 253415444052525 |
7 | 22424614411130 |
oct | 3262474600305 |
9 | 730008331668 |
10 | 230132220101 |
11 | 89664703143 |
12 | 38726994145 |
13 | 18916bc9404 |
14 | b1d1d07217 |
15 | 5ebd9b971b |
hex | 3594f300c5 |
230132220101 has 8 divisors (see below), whose sum is σ = 263021478720. Its totient is φ = 197246268288.
The previous prime is 230132220067. The next prime is 230132220107. The reversal of 230132220101 is 101022231032.
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 230132220101 - 26 = 230132220037 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 230132220101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230132220107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 675731 + ... + 957536.
It is an arithmetic number, because the mean of its divisors is an integer number (32877684840).
Almost surely, 2230132220101 is an apocalyptic number.
It is an amenable number.
230132220101 is a deficient number, since it is larger than the sum of its proper divisors (32889258619).
230132220101 is a wasteful number, since it uses less digits than its factorization.
230132220101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1653403.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 230132220101 its reverse (101022231032), we get a palindrome (331154451133).
The spelling of 230132220101 in words is "two hundred thirty billion, one hundred thirty-two million, two hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •