Base | Representation |
---|---|
bin | 1010001100001110100… |
… | …11100110010111100111 |
3 | 1020110211102100122011102 |
4 | 11012013103212113213 |
5 | 21214113034204111 |
6 | 424510135430315 |
7 | 34204231254434 |
oct | 5060723462747 |
9 | 1213742318142 |
10 | 350162413031 |
11 | 12555960a6a2 |
12 | 57a4482539b |
13 | 27035425502 |
14 | 12d3b26cb8b |
15 | 919643613b |
hex | 51874e65e7 |
350162413031 has 4 divisors (see below), whose sum is σ = 350368756752. Its totient is φ = 349956069312.
The previous prime is 350162413009. The next prime is 350162413049. The reversal of 350162413031 is 130314261053.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 350162413031 - 210 = 350162412007 is a prime.
It is a super-2 number, since 2×3501624130312 (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 = 350162412985 and 350162413003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (350162416031) 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, 103169315 + ... + 103172708.
It is an arithmetic number, because the mean of its divisors is an integer number (87592189188).
Almost surely, 2350162413031 is an apocalyptic number.
350162413031 is a deficient number, since it is larger than the sum of its proper divisors (206343721).
350162413031 is a wasteful number, since it uses less digits than its factorization.
350162413031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 206343720.
The product of its (nonzero) digits is 6480, while the sum is 29.
Adding to 350162413031 its reverse (130314261053), we get a palindrome (480476674084).
The spelling of 350162413031 in words is "three hundred fifty billion, one hundred sixty-two million, four hundred thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •