Base | Representation |
---|---|
bin | 1111011100000000010… |
… | …10001100100101010011 |
3 | 1212201010122202111022212 |
4 | 13232000022030211103 |
5 | 32142310332242120 |
6 | 1043402100022335 |
7 | 53215402150625 |
oct | 7560012144523 |
9 | 1781118674285 |
10 | 530431134035 |
11 | 194a55601950 |
12 | 869743919ab |
13 | 3b03393566a |
14 | 1b95ca18c15 |
15 | dbe75206c5 |
hex | 7b8028c953 |
530431134035 has 32 divisors (see below), whose sum is σ = 699665909184. Its totient is φ = 382838976000.
The previous prime is 530431134019. The next prime is 530431134041.
530431134035 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 530431134035 - 24 = 530431134019 is a prime.
It is a super-2 number, since 2×5304311340352 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 530431133992 and 530431134010.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 7051925 + ... + 7126745.
It is an arithmetic number, because the mean of its divisors is an integer number (21864559662).
Almost surely, 2530431134035 is an apocalyptic number.
530431134035 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
530431134035 is a deficient number, since it is larger than the sum of its proper divisors (169234775149).
530431134035 is a wasteful number, since it uses less digits than its factorization.
530431134035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75815.
The product of its (nonzero) digits is 32400, while the sum is 32.
It can be divided in two parts, 530431 and 134035, that added together give a palindrome (664466).
The spelling of 530431134035 in words is "five hundred thirty billion, four hundred thirty-one million, one hundred thirty-four thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •