Base | Representation |
---|---|
bin | 100010010110001111000011… |
… | …0011100011101011100111101 |
3 | 1110121201200122002122011122020 |
4 | 1010230132012130131130331 |
5 | 304044441142332011031 |
6 | 2550321242101110353 |
7 | 120431451025602450 |
oct | 10454360634353475 |
9 | 1417650562564566 |
10 | 302123140110141 |
11 | 882a1782292679 |
12 | 29a755a43b83b9 |
13 | cc7712258328c |
14 | 5486ba36a7497 |
15 | 24dddb2310096 |
hex | 112c78671d73d |
302123140110141 has 16 divisors (see below), whose sum is σ = 462763497120384. Its totient is φ = 171747277277184.
The previous prime is 302123140110079. The next prime is 302123140110163. The reversal of 302123140110141 is 141011041321203.
It is not a de Polignac number, because 302123140110141 - 213 = 302123140101949 is a prime.
It is a super-2 number, since 2×3021231401101412 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (302123140110191) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 37271540496 + ... + 37271548601.
It is an arithmetic number, because the mean of its divisors is an integer number (28922718570024).
Almost surely, 2302123140110141 is an apocalyptic number.
It is an amenable number.
302123140110141 is a deficient number, since it is larger than the sum of its proper divisors (160640357010243).
302123140110141 is a wasteful number, since it uses less digits than its factorization.
302123140110141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 74543089300.
The product of its (nonzero) digits is 576, while the sum is 24.
Adding to 302123140110141 its reverse (141011041321203), we get a palindrome (443134181431344).
The spelling of 302123140110141 in words is "three hundred two trillion, one hundred twenty-three billion, one hundred forty million, one hundred ten thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •