Base | Representation |
---|---|
bin | 1101011000110110111… |
… | …1110111011100101000 |
3 | 210222200220000212111201 |
4 | 3112031233313130220 |
5 | 12232030404331044 |
6 | 253355450333544 |
7 | 22421616441625 |
oct | 3261557673450 |
9 | 728626025451 |
10 | 230011402024 |
11 | 89602492798 |
12 | 386b242a2b4 |
13 | 188c7b77021 |
14 | b1bdc5734c |
15 | 5eb30a17d4 |
hex | 358dbf7728 |
230011402024 has 128 divisors (see below), whose sum is σ = 478247328000. Its totient is φ = 103217393664.
The previous prime is 230011402021. The next prime is 230011402051. The reversal of 230011402024 is 420204110032.
It is a super-2 number, since 2×2300114020242 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 230011401992 and 230011402010.
It is not an unprimeable number, because it can be changed into a prime (230011402021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 277456042 + ... + 277456870.
It is an arithmetic number, because the mean of its divisors is an integer number (3736307250).
Almost surely, 2230011402024 is an apocalyptic number.
It is an amenable number.
230011402024 is an abundant number, since it is smaller than the sum of its proper divisors (248235925976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
230011402024 is a wasteful number, since it uses less digits than its factorization.
230011402024 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1667 (or 1663 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 19.
Adding to 230011402024 its reverse (420204110032), we get a palindrome (650215512056).
The spelling of 230011402024 in words is "two hundred thirty billion, eleven million, four hundred two thousand, twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •