Base | Representation |
---|---|
bin | 1101011000110101010… |
… | …0011100001100010111 |
3 | 210222200101111121100011 |
4 | 3112031110130030113 |
5 | 12232022034300003 |
6 | 253355032301051 |
7 | 22421501356132 |
oct | 3261524341427 |
9 | 728611447304 |
10 | 230004212503 |
11 | 895a942213a |
12 | 386abb41787 |
13 | 188c652a780 |
14 | b1bcd05219 |
15 | 5eb263146d |
hex | 358d51c317 |
230004212503 has 64 divisors (see below), whose sum is σ = 270847342080. Its totient is φ = 194067726336.
The previous prime is 230004212491. The next prime is 230004212561. The reversal of 230004212503 is 305212400032.
230004212503 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-230004212503 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 (230004212573) 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 63 ways as a sum of consecutive naturals, for example, 579355501 + ... + 579355897.
It is an arithmetic number, because the mean of its divisors is an integer number (4231989720).
Almost surely, 2230004212503 is an apocalyptic number.
230004212503 is a deficient number, since it is larger than the sum of its proper divisors (40843129577).
230004212503 is a wasteful number, since it uses less digits than its factorization.
230004212503 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 701 (or 667 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 22.
Adding to 230004212503 its reverse (305212400032), we get a palindrome (535216612535).
The spelling of 230004212503 in words is "two hundred thirty billion, four million, two hundred twelve thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •