Base | Representation |
---|---|
bin | 101101100111010101111… |
… | …111000000011000111101 |
3 | 102002200000010211221112101 |
4 | 231213111333000120331 |
5 | 402324201013104321 |
6 | 10400005231305101 |
7 | 442316556524161 |
oct | 55472577003075 |
9 | 12080003757471 |
10 | 3134621222461 |
11 | aa9426a62723 |
12 | 42761637b191 |
13 | 199793c426a1 |
14 | aba06024ca1 |
15 | 5681313d791 |
hex | 2d9d5fc063d |
3134621222461 has 8 divisors (see below), whose sum is σ = 3216487411584. Its totient is φ = 3053387205120.
The previous prime is 3134621222413. The next prime is 3134621222483. The reversal of 3134621222461 is 1642221264313.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3134621222461 - 211 = 3134621220413 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3134621222461.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3134621220461) 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, 158032900 + ... + 158052733.
It is an arithmetic number, because the mean of its divisors is an integer number (402060926448).
Almost surely, 23134621222461 is an apocalyptic number.
It is an amenable number.
3134621222461 is a deficient number, since it is larger than the sum of its proper divisors (81866189123).
3134621222461 is a wasteful number, since it uses less digits than its factorization.
3134621222461 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 316085891.
The product of its digits is 82944, while the sum is 37.
Adding to 3134621222461 its reverse (1642221264313), we get a palindrome (4776842486774).
The spelling of 3134621222461 in words is "three trillion, one hundred thirty-four billion, six hundred twenty-one million, two hundred twenty-two thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •