Base | Representation |
---|---|
bin | 100000001010001111… |
… | …000000101000000011 |
3 | 10022010120000011122201 |
4 | 200022033000220003 |
5 | 1031210022222001 |
6 | 23510304414031 |
7 | 2331502304332 |
oct | 401217005003 |
9 | 108116004581 |
10 | 34531445251 |
11 | 13710111a06 |
12 | 6838617317 |
13 | 334412b654 |
14 | 19581bbd19 |
15 | d71879501 |
hex | 80a3c0a03 |
34531445251 has 2 divisors, whose sum is σ = 34531445252. Its totient is φ = 34531445250.
The previous prime is 34531445231. The next prime is 34531445261. The reversal of 34531445251 is 15254413543.
It is a strong prime.
It is an emirp because it is prime and its reverse (15254413543) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 34531445251 - 215 = 34531412483 is a prime.
It is a super-2 number, since 2×345314452512 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 34531445251.
It is not a weakly prime, because it can be changed into another prime (34531445231) 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 as a sum of consecutive naturals, namely, 17265722625 + 17265722626.
It is an arithmetic number, because the mean of its divisors is an integer number (17265722626).
Almost surely, 234531445251 is an apocalyptic number.
34531445251 is a deficient number, since it is larger than the sum of its proper divisors (1).
34531445251 is an equidigital number, since it uses as much as digits as its factorization.
34531445251 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 144000, while the sum is 37.
Adding to 34531445251 its reverse (15254413543), we get a palindrome (49785858794).
The spelling of 34531445251 in words is "thirty-four billion, five hundred thirty-one million, four hundred forty-five thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •