Base | Representation |
---|---|
bin | 100000001010010010… |
… | …010100100000011001 |
3 | 10022010121122021010202 |
4 | 200022102110200121 |
5 | 1031210233004423 |
6 | 23510335151545 |
7 | 2331512550464 |
oct | 401222244031 |
9 | 108117567122 |
10 | 34532313113 |
11 | 13710654a51 |
12 | 68389755b5 |
13 | 334437368c |
14 | 19583662db |
15 | d7199b728 |
hex | 80a494819 |
34532313113 has 4 divisors (see below), whose sum is σ = 34542101940. Its totient is φ = 34522524288.
The previous prime is 34532313103. The next prime is 34532313119. The reversal of 34532313113 is 31131323543.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 20827396489 + 13704916624 = 144317^2 + 117068^2 .
It is a cyclic number.
It is not a de Polignac number, because 34532313113 - 228 = 34263877657 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (34532313119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4889120 + ... + 4896177.
It is an arithmetic number, because the mean of its divisors is an integer number (8635525485).
Almost surely, 234532313113 is an apocalyptic number.
It is an amenable number.
34532313113 is a deficient number, since it is larger than the sum of its proper divisors (9788827).
34532313113 is an equidigital number, since it uses as much as digits as its factorization.
34532313113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9788826.
The product of its digits is 9720, while the sum is 29.
Adding to 34532313113 its reverse (31131323543), we get a palindrome (65663636656).
The spelling of 34532313113 in words is "thirty-four billion, five hundred thirty-two million, three hundred thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •