Base | Representation |
---|---|
bin | 101110111100000000110… |
… | …000001101000010111001 |
3 | 102102100122221112121001201 |
4 | 232330000300031002321 |
5 | 410321342431410031 |
6 | 10505442304014201 |
7 | 452015500524622 |
oct | 56740060150271 |
9 | 12370587477051 |
10 | 3225533075641 |
11 | 1033a39371588 |
12 | 441168601361 |
13 | 1a522194b556 |
14 | b218c086a49 |
15 | 58d84588d61 |
hex | 2ef00c0d0b9 |
3225533075641 has 4 divisors (see below), whose sum is σ = 3225750840612. Its totient is φ = 3225315310672.
The previous prime is 3225533075621. The next prime is 3225533075651. The reversal of 3225533075641 is 1465703355223.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2405957743225 + 819575332416 = 1551115^2 + 905304^2 .
It is a cyclic number.
It is not a de Polignac number, because 3225533075641 - 211 = 3225533073593 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3225533075591 and 3225533075600.
It is not an unprimeable number, because it can be changed into a prime (3225533075621) 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, 108860266 + ... + 108889891.
It is an arithmetic number, because the mean of its divisors is an integer number (806437710153).
Almost surely, 23225533075641 is an apocalyptic number.
It is an amenable number.
3225533075641 is a deficient number, since it is larger than the sum of its proper divisors (217764971).
3225533075641 is a wasteful number, since it uses less digits than its factorization.
3225533075641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 217764970.
The product of its (nonzero) digits is 2268000, while the sum is 46.
The spelling of 3225533075641 in words is "three trillion, two hundred twenty-five billion, five hundred thirty-three million, seventy-five thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •