Base | Representation |
---|---|
bin | 100010010110110100010110… |
… | …0111100111001100101000101 |
3 | 1110122000100101121102210011112 |
4 | 1010231220230330321211011 |
5 | 304102244220204340031 |
6 | 2550422130413014405 |
7 | 120440315040363326 |
oct | 10455505474714505 |
9 | 1418010347383145 |
10 | 302203243043141 |
11 | 88322748303850 |
12 | 29a8901a784405 |
13 | cc81849b1789b |
14 | 548aa01d9844d |
15 | 24e0eee86262b |
hex | 112da2cf39945 |
302203243043141 has 32 divisors (see below), whose sum is σ = 336122490482688. Its totient is φ = 269395943351040.
The previous prime is 302203243043131. The next prime is 302203243043147. The reversal of 302203243043141 is 141340342302203.
It is a de Polignac number, because none of the positive numbers 2k-302203243043141 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 302203243043098 and 302203243043107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (302203243043147) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2452548365 + ... + 2452671581.
It is an arithmetic number, because the mean of its divisors is an integer number (10503827827584).
Almost surely, 2302203243043141 is an apocalyptic number.
It is an amenable number.
302203243043141 is a deficient number, since it is larger than the sum of its proper divisors (33919247439547).
302203243043141 is a wasteful number, since it uses less digits than its factorization.
302203243043141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 138441.
The product of its (nonzero) digits is 41472, while the sum is 32.
Adding to 302203243043141 its reverse (141340342302203), we get a palindrome (443543585345344).
The spelling of 302203243043141 in words is "three hundred two trillion, two hundred three billion, two hundred forty-three million, forty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •