Base | Representation |
---|---|
bin | 1101011001010110111… |
… | …0010001010000110101 |
3 | 211000001012210120110221 |
4 | 3112111232101100311 |
5 | 12232314132414310 |
6 | 253421030214341 |
7 | 22425132634663 |
oct | 3262556212065 |
9 | 730035716427 |
10 | 230145201205 |
11 | 89670a6a027 |
12 | 3872b1b43b1 |
13 | 189197c2b3a |
14 | b1d3925c33 |
15 | 5ebebd0ada |
hex | 3595b91435 |
230145201205 has 16 divisors (see below), whose sum is σ = 280126644480. Its totient is φ = 181488835008.
The previous prime is 230145201191. The next prime is 230145201227. The reversal of 230145201205 is 502102541032.
230145201205 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 230145201205 - 223 = 230136812597 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 230145201205.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 233107 + ... + 717376.
It is an arithmetic number, because the mean of its divisors is an integer number (17507915280).
Almost surely, 2230145201205 is an apocalyptic number.
It is an amenable number.
230145201205 is a deficient number, since it is larger than the sum of its proper divisors (49981443275).
230145201205 is an equidigital number, since it uses as much as digits as its factorization.
230145201205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 951180.
The product of its (nonzero) digits is 2400, while the sum is 25.
Adding to 230145201205 its reverse (502102541032), we get a palindrome (732247742237).
The spelling of 230145201205 in words is "two hundred thirty billion, one hundred forty-five million, two hundred one thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •