Base | Representation |
---|---|
bin | 111111010011100010110… |
… | …111100010101000001001 |
3 | 120101212220210121202010102 |
4 | 333103202313202220021 |
5 | 1032233420124122441 |
6 | 13130301203455145 |
7 | 626204546230412 |
oct | 77234267425011 |
9 | 16355823552112 |
10 | 4350313114121 |
11 | 1427a59382217 |
12 | 5a31530874b5 |
13 | 257304506c90 |
14 | 1107b05da809 |
15 | 7826575d69b |
hex | 3f4e2de2a09 |
4350313114121 has 8 divisors (see below), whose sum is σ = 4684995895944. Its totient is φ = 4015636519680.
The previous prime is 4350313114087. The next prime is 4350313114177. The reversal of 4350313114121 is 1214113130534.
It can be written as a sum of positive squares in 4 ways, for example, as 1500331014400 + 2849982099721 = 1224880^2 + 1688189^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4350313114121 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (4350313114621) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 31586 + ... + 2949851.
It is an arithmetic number, because the mean of its divisors is an integer number (585624486993).
Almost surely, 24350313114121 is an apocalyptic number.
It is an amenable number.
4350313114121 is a deficient number, since it is larger than the sum of its proper divisors (334682781823).
4350313114121 is a wasteful number, since it uses less digits than its factorization.
4350313114121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3093691.
The product of its (nonzero) digits is 4320, while the sum is 29.
Adding to 4350313114121 its reverse (1214113130534), we get a palindrome (5564426244655).
The spelling of 4350313114121 in words is "four trillion, three hundred fifty billion, three hundred thirteen million, one hundred fourteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.318 sec. • engine limits •