Base | Representation |
---|---|
bin | 1110000011011111101… |
… | …0011011000001110000 |
3 | 212002020111111101201022 |
4 | 3200313322123001300 |
5 | 12424000243334022 |
6 | 302531244555012 |
7 | 23305340044550 |
oct | 3406772330160 |
9 | 762214441638 |
10 | 241456230512 |
11 | 93445824832 |
12 | 3a967252a68 |
13 | 199cccaa4a3 |
14 | b987c3b160 |
15 | 6432c0bc42 |
hex | 3837e9b070 |
241456230512 has 40 divisors (see below), whose sum is σ = 542632995456. Its totient is φ = 101936742336.
The previous prime is 241456230511. The next prime is 241456230527. The reversal of 241456230512 is 215032654142.
241456230512 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2414562305122 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (241456230511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16080998 + ... + 16096005.
Almost surely, 2241456230512 is an apocalyptic number.
It is an amenable number.
241456230512 is an abundant number, since it is smaller than the sum of its proper divisors (301176764944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
241456230512 is a wasteful number, since it uses less digits than its factorization.
241456230512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32177085 (or 32177079 counting only the distinct ones).
The product of its (nonzero) digits is 57600, while the sum is 35.
Adding to 241456230512 its reverse (215032654142), we get a palindrome (456488884654).
The spelling of 241456230512 in words is "two hundred forty-one billion, four hundred fifty-six million, two hundred thirty thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •