Base | Representation |
---|---|
bin | 1101011001001110100… |
… | …0010001011001000000 |
3 | 210222221202200221121100 |
4 | 3112103220101121000 |
5 | 12232231134340212 |
6 | 253413333254400 |
7 | 22424225234400 |
oct | 3262350213100 |
9 | 728852627540 |
10 | 230110074432 |
11 | 89653157837 |
12 | 3871b494400 |
13 | 18912444474 |
14 | b1ccdc0800 |
15 | 5ebba92bdc |
hex | 3593a11640 |
230110074432 has 126 divisors (see below), whose sum is σ = 767253806358. Its totient is φ = 65745727488.
The previous prime is 230110074421. The next prime is 230110074443. The reversal of 230110074432 is 234470011032.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (230110074421) and next prime (230110074443).
It can be written as a sum of positive squares in only one way, i.e., 139475359296 + 90634715136 = 373464^2 + 301056^2 .
It is a tau number, because it is divible by the number of its divisors (126).
It is a junction number, because it is equal to n+sod(n) for n = 230110074396 and 230110074405.
It is an unprimeable number.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 4048273 + ... + 4104720.
Almost surely, 2230110074432 is an apocalyptic number.
It is an amenable number.
230110074432 is an abundant number, since it is smaller than the sum of its proper divisors (537143731926).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
230110074432 is a wasteful number, since it uses less digits than its factorization.
230110074432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8153025 (or 8153005 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 27.
Adding to 230110074432 its reverse (234470011032), we get a palindrome (464580085464).
The spelling of 230110074432 in words is "two hundred thirty billion, one hundred ten million, seventy-four thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •