Base | Representation |
---|---|
bin | 110100010110011011101111… |
… | …110011001001010010110101 |
3 | 1010012012201210020222211211100 |
4 | 310112123233303021102311 |
5 | 220134223100222001123 |
6 | 2133402451511400313 |
7 | 66332202553430346 |
oct | 6426335763112265 |
9 | 1105181706884740 |
10 | 230240040031413 |
11 | 673a8286285855 |
12 | 219a608b683099 |
13 | 9b61709177779 |
14 | 40bd96aac00cd |
15 | 1b94112580643 |
hex | d166efcc94b5 |
230240040031413 has 12 divisors (see below), whose sum is σ = 332569086595200. Its totient is φ = 153493295459496.
The previous prime is 230240040031373. The next prime is 230240040031427. The reversal of 230240040031413 is 314130040042032.
230240040031413 is a `hidden beast` number, since 2 + 3 + 0 + 240 + 0 + 4 + 0 + 0 + 3 + 1 + 413 = 666.
It is not a de Polignac number, because 230240040031413 - 213 = 230240040023221 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230240040032413) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 28308238 + ... + 35522336.
It is an arithmetic number, because the mean of its divisors is an integer number (27714090549600).
Almost surely, 2230240040031413 is an apocalyptic number.
It is an amenable number.
230240040031413 is a deficient number, since it is larger than the sum of its proper divisors (102329046563787).
230240040031413 is a wasteful number, since it uses less digits than its factorization.
230240040031413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10760248 (or 10760245 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
Adding to 230240040031413 its reverse (314130040042032), we get a palindrome (544370080073445).
The spelling of 230240040031413 in words is "two hundred thirty trillion, two hundred forty billion, forty million, thirty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •