Base | Representation |
---|---|
bin | 101111000011111010110… |
… | …000110011001110101101 |
3 | 102110011120120220012112212 |
4 | 233003322300303032231 |
5 | 410441234230101331 |
6 | 10513404525540205 |
7 | 452436043466660 |
oct | 57037260631655 |
9 | 12404516805485 |
10 | 3234022503341 |
11 | 10375a5435233 |
12 | 442937714665 |
13 | 1a5c756b4556 |
14 | b27557536d7 |
15 | 591cea0ed2b |
hex | 2f0fac333ad |
3234022503341 has 8 divisors (see below), whose sum is σ = 3700516642944. Its totient is φ = 2768651094960.
The previous prime is 3234022503301. The next prime is 3234022503347. The reversal of 3234022503341 is 1433052204323.
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 3234022503341 - 26 = 3234022503277 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3234022503298 and 3234022503307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3234022503347) 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, 280676630 + ... + 280688151.
It is an arithmetic number, because the mean of its divisors is an integer number (462564580368).
Almost surely, 23234022503341 is an apocalyptic number.
It is an amenable number.
3234022503341 is a deficient number, since it is larger than the sum of its proper divisors (466494139603).
3234022503341 is an equidigital number, since it uses as much as digits as its factorization.
3234022503341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 561365611.
The product of its (nonzero) digits is 51840, while the sum is 32.
Adding to 3234022503341 its reverse (1433052204323), we get a palindrome (4667074707664).
The spelling of 3234022503341 in words is "three trillion, two hundred thirty-four billion, twenty-two million, five hundred three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •