Base | Representation |
---|---|
bin | 110101010011010011011110… |
… | …010010100111111111001101 |
3 | 1010202000121212000202201210202 |
4 | 311103103132102213333031 |
5 | 221211241343334040023 |
6 | 2150324243201143245 |
7 | 100243335401310362 |
oct | 6523233622477715 |
9 | 1122017760681722 |
10 | 234423044440013 |
11 | 68770289210210 |
12 | 2236090b32ab25 |
13 | a0a5cc91837c0 |
14 | 41c61c8c4c469 |
15 | 1c17d348a9128 |
hex | d534de4a7fcd |
234423044440013 has 32 divisors (see below), whose sum is σ = 289904278003200. Its totient is φ = 186363016401600.
The previous prime is 234423044440007. The next prime is 234423044440027. The reversal of 234423044440013 is 310044440324432.
It is a cyclic number.
It is not a de Polignac number, because 234423044440013 - 220 = 234423043391437 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (234423044040013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 283402118 + ... + 284228088.
It is an arithmetic number, because the mean of its divisors is an integer number (9059508687600).
Almost surely, 2234423044440013 is an apocalyptic number.
It is an amenable number.
234423044440013 is a deficient number, since it is larger than the sum of its proper divisors (55481233563187).
234423044440013 is a wasteful number, since it uses less digits than its factorization.
234423044440013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 930473.
The product of its (nonzero) digits is 442368, while the sum is 38.
Adding to 234423044440013 its reverse (310044440324432), we get a palindrome (544467484764445).
The spelling of 234423044440013 in words is "two hundred thirty-four trillion, four hundred twenty-three billion, forty-four million, four hundred forty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •