Base | Representation |
---|---|
bin | 1101101001000010011… |
… | …1100000110010100101 |
3 | 211101220120100200000012 |
4 | 3122100213200302211 |
5 | 12314424223323023 |
6 | 255354434300005 |
7 | 22634344322150 |
oct | 3322047406245 |
9 | 741816320005 |
10 | 234354511013 |
11 | 90431014867 |
12 | 39504a27605 |
13 | 1913a8ab1bc |
14 | b4b29a2c97 |
15 | 61694ed978 |
hex | 36909e0ca5 |
234354511013 has 4 divisors (see below), whose sum is σ = 267833726880. Its totient is φ = 200875295148.
The previous prime is 234354510997. The next prime is 234354511019. The reversal of 234354511013 is 310115453432.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 234354511013 - 24 = 234354510997 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 (234354511019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16739607923 + ... + 16739607936.
It is an arithmetic number, because the mean of its divisors is an integer number (66958431720).
Almost surely, 2234354511013 is an apocalyptic number.
It is an amenable number.
234354511013 is a deficient number, since it is larger than the sum of its proper divisors (33479215867).
234354511013 is an equidigital number, since it uses as much as digits as its factorization.
234354511013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33479215866.
The product of its (nonzero) digits is 21600, while the sum is 32.
Adding to 234354511013 its reverse (310115453432), we get a palindrome (544469964445).
The spelling of 234354511013 in words is "two hundred thirty-four billion, three hundred fifty-four million, five hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •