Base | Representation |
---|---|
bin | 1101011001111111001… |
… | …1011010100111111000 |
3 | 211000111000000211011210 |
4 | 3112133303122213320 |
5 | 12233140431304144 |
6 | 253445511123120 |
7 | 22432255303524 |
oct | 3263763324770 |
9 | 730430024153 |
10 | 230314322424 |
11 | 8974848132a |
12 | 387779734a0 |
13 | 18945858174 |
14 | b20c18ad84 |
15 | 5ece98aab9 |
hex | 359fcda9f8 |
230314322424 has 32 divisors (see below), whose sum is σ = 577820401920. Its totient is φ = 76500161376.
The previous prime is 230314322317. The next prime is 230314322461. The reversal of 230314322424 is 424223413032.
It is a super-2 number, since 2×2303143224242 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 230314322391 and 230314322400.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16948032 + ... + 16961615.
It is an arithmetic number, because the mean of its divisors is an integer number (18056887560).
Almost surely, 2230314322424 is an apocalyptic number.
230314322424 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
230314322424 is an abundant number, since it is smaller than the sum of its proper divisors (347506079496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
230314322424 is a wasteful number, since it uses less digits than its factorization.
230314322424 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33909939 (or 33909935 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 30.
Adding to 230314322424 its reverse (424223413032), we get a palindrome (654537735456).
The spelling of 230314322424 in words is "two hundred thirty billion, three hundred fourteen million, three hundred twenty-two thousand, four hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.158 sec. • engine limits •