Base | Representation |
---|---|
bin | 1010001110011100100… |
… | …10000110001100010110 |
3 | 1020120220102000221202110 |
4 | 11013032102012030112 |
5 | 21224032404421210 |
6 | 425224234251450 |
7 | 34245600635640 |
oct | 5071622061426 |
9 | 1216812027673 |
10 | 351353201430 |
11 | 12600a7a4640 |
12 | 58117586b86 |
13 | 27195042c2a |
14 | 13011481890 |
15 | 9215c52420 |
hex | 51ce486316 |
351353201430 has 128 divisors (see below), whose sum is σ = 1051492285440. Its totient is φ = 72996618240.
The previous prime is 351353201429. The next prime is 351353201447. The reversal of 351353201430 is 34102353153.
It is a super-2 number, since 2×3513532014302 (a number of 24 digits) contains 22 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 (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 28381402 + ... + 28393778.
It is an arithmetic number, because the mean of its divisors is an integer number (8214783480).
Almost surely, 2351353201430 is an apocalyptic number.
351353201430 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
351353201430 is an abundant number, since it is smaller than the sum of its proper divisors (700139084010).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
351353201430 is a wasteful number, since it uses less digits than its factorization.
351353201430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24694.
The product of its (nonzero) digits is 16200, while the sum is 30.
Adding to 351353201430 its reverse (34102353153), we get a palindrome (385455554583).
The spelling of 351353201430 in words is "three hundred fifty-one billion, three hundred fifty-three million, two hundred one thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •