Base | Representation |
---|---|
bin | 100000001001110111… |
… | …100111011100111111 |
3 | 10022010010110121120001 |
4 | 200021313213130333 |
5 | 1031201440002311 |
6 | 23505525135131 |
7 | 2331366213502 |
oct | 401167473477 |
9 | 108103417501 |
10 | 34525312831 |
11 | 13707703599 |
12 | 683655a4a7 |
13 | 3342a922b9 |
14 | 1957463139 |
15 | d710674c1 |
hex | 809de773f |
34525312831 has 4 divisors (see below), whose sum is σ = 35458429432. Its totient is φ = 33592196232.
The previous prime is 34525312799. The next prime is 34525312867. The reversal of 34525312831 is 13821352543.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 34525312831 - 25 = 34525312799 is a prime.
It is a super-2 number, since 2×345253128312 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (37), and also a Moran number because the ratio is a prime number: 933116563 = 34525312831 / (3 + 4 + 5 + 2 + 5 + 3 + 1 + 2 + 8 + 3 + 1).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (34525316831) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 466558245 + ... + 466558318.
It is an arithmetic number, because the mean of its divisors is an integer number (8864607358).
Almost surely, 234525312831 is an apocalyptic number.
34525312831 is a deficient number, since it is larger than the sum of its proper divisors (933116601).
34525312831 is an equidigital number, since it uses as much as digits as its factorization.
34525312831 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 933116600.
The product of its digits is 86400, while the sum is 37.
The spelling of 34525312831 in words is "thirty-four billion, five hundred twenty-five million, three hundred twelve thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •