Base | Representation |
---|---|
bin | 101111001110100011011… |
… | …010110110010111101101 |
3 | 102111021001102202102110201 |
4 | 233032203122312113231 |
5 | 411133131130030013 |
6 | 10522534022033501 |
7 | 453322036054516 |
oct | 57164332662755 |
9 | 12437042672421 |
10 | 3245442033133 |
11 | 1041425467a63 |
12 | 444ba3b78891 |
13 | 1a70754ca881 |
14 | b311a22da0d |
15 | 5964c31e3dd |
hex | 2f3a36b65ed |
3245442033133 has 8 divisors (see below), whose sum is σ = 3302874624960. Its totient is φ = 3188090278080.
The previous prime is 3245442032983. The next prime is 3245442033149. The reversal of 3245442033133 is 3313302445423.
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 3245442033133 - 221 = 3245439935981 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3245442033092 and 3245442033101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3245442037133) 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, 20128185 + ... + 20288782.
It is an arithmetic number, because the mean of its divisors is an integer number (412859328120).
Almost surely, 23245442033133 is an apocalyptic number.
It is an amenable number.
3245442033133 is a deficient number, since it is larger than the sum of its proper divisors (57432591827).
3245442033133 is a wasteful number, since it uses less digits than its factorization.
3245442033133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40418387.
The product of its (nonzero) digits is 311040, while the sum is 37.
Adding to 3245442033133 its reverse (3313302445423), we get a palindrome (6558744478556).
The spelling of 3245442033133 in words is "three trillion, two hundred forty-five billion, four hundred forty-two million, thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •