Base | Representation |
---|---|
bin | 1010001110010110100… |
… | …11000100100110110110 |
3 | 1020120202220210211101210 |
4 | 11013023103010212312 |
5 | 21223432100003210 |
6 | 425215245102250 |
7 | 34244422203525 |
oct | 5071323044666 |
9 | 1216686724353 |
10 | 351303125430 |
11 | 125a94501814 |
12 | 58102857986 |
13 | 2718785c06a |
14 | 130089684bc |
15 | 921165ee20 |
hex | 51cb4c49b6 |
351303125430 has 64 divisors (see below), whose sum is σ = 863204983488. Its totient is φ = 91472424960.
The previous prime is 351303125429. The next prime is 351303125501. The reversal of 351303125430 is 34521303153.
It is a super-5 number, since 5×3513031254305 (a number of 59 digits) contains 55555 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 449907 + ... + 951326.
It is an arithmetic number, because the mean of its divisors is an integer number (13487577867).
Almost surely, 2351303125430 is an apocalyptic number.
351303125430 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
351303125430 is an abundant number, since it is smaller than the sum of its proper divisors (511901858058).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
351303125430 is a wasteful number, since it uses less digits than its factorization.
351303125430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1401441.
The product of its (nonzero) digits is 16200, while the sum is 30.
Adding to 351303125430 its reverse (34521303153), we get a palindrome (385824428583).
The spelling of 351303125430 in words is "three hundred fifty-one billion, three hundred three million, one hundred twenty-five thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •