Base | Representation |
---|---|
bin | 1010001100101110000… |
… | …10000110001101101011 |
3 | 1020111111210211110121122 |
4 | 11012113002012031223 |
5 | 21220133110312311 |
6 | 424552242525455 |
7 | 34213614031520 |
oct | 5062702061553 |
9 | 1214453743548 |
10 | 350426260331 |
11 | 125684541014 |
12 | 57ab906688b |
13 | 27077ca5984 |
14 | 12d64311147 |
15 | 91ae6a30db |
hex | 519708636b |
350426260331 has 4 divisors (see below), whose sum is σ = 400487154672. Its totient is φ = 300365365992.
The previous prime is 350426260291. The next prime is 350426260357. The reversal of 350426260331 is 133062624053.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-350426260331 is a prime.
It is a super-2 number, since 2×3504262603312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 350426260291 and 350426260300.
It is not an unprimeable number, because it can be changed into a prime (350426260231) 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, 25030447160 + ... + 25030447173.
It is an arithmetic number, because the mean of its divisors is an integer number (100121788668).
Almost surely, 2350426260331 is an apocalyptic number.
350426260331 is a deficient number, since it is larger than the sum of its proper divisors (50060894341).
350426260331 is an equidigital number, since it uses as much as digits as its factorization.
350426260331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50060894340.
The product of its (nonzero) digits is 77760, while the sum is 35.
Adding to 350426260331 its reverse (133062624053), we get a palindrome (483488884384).
The spelling of 350426260331 in words is "three hundred fifty billion, four hundred twenty-six million, two hundred sixty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •