Base | Representation |
---|---|
bin | 110100010011010010100011… |
… | …011110100110110111011101 |
3 | 1010011110002011211122212212220 |
4 | 310103102203132212313131 |
5 | 220122203133332324201 |
6 | 2133115323312215553 |
7 | 66310454300662203 |
oct | 6423224336466735 |
9 | 1104402154585786 |
10 | 230024011214301 |
11 | 673246a9687067 |
12 | 2197023bb3a5b9 |
13 | 9b4722c122935 |
14 | 40b3315cc9073 |
15 | 1b8d6bbd22036 |
hex | d134a37a6ddd |
230024011214301 has 24 divisors (see below), whose sum is σ = 309610924527744. Its totient is φ = 151906790206080.
The previous prime is 230024011214293. The next prime is 230024011214303. The reversal of 230024011214301 is 103412110420032.
It is not a de Polignac number, because 230024011214301 - 23 = 230024011214293 is a prime.
It is a super-2 number, since 2×2300240112143012 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230024011214303) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 151475745 + ... + 152986761.
It is an arithmetic number, because the mean of its divisors is an integer number (12900455188656).
Almost surely, 2230024011214301 is an apocalyptic number.
It is an amenable number.
230024011214301 is a deficient number, since it is larger than the sum of its proper divisors (79586913313443).
230024011214301 is a wasteful number, since it uses less digits than its factorization.
230024011214301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1515509 (or 1515400 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 230024011214301 its reverse (103412110420032), we get a palindrome (333436121634333).
The spelling of 230024011214301 in words is "two hundred thirty trillion, twenty-four billion, eleven million, two hundred fourteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •