Base | Representation |
---|---|
bin | 100010101100000100111100… |
… | …1110111001001011011101001 |
3 | 1111000100200020121202020122210 |
4 | 1011120021321313021123221 |
5 | 304443132211423021441 |
6 | 3000540312502435333 |
7 | 121161363461421504 |
oct | 10530117167113351 |
9 | 1430320217666583 |
10 | 305125111142121 |
11 | 8924991870a8a6 |
12 | 2a27b35a432b49 |
13 | 1013423655719a |
14 | 554c1c427813b |
15 | 254200eae3616 |
hex | 1158279dc96e9 |
305125111142121 has 8 divisors (see below), whose sum is σ = 406894121508160. Its totient is φ = 203386420768752.
The previous prime is 305125111142039. The next prime is 305125111142143. The reversal of 305125111142121 is 121241111521503.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-305125111142121 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (305125111142521) 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, 7579974685 + ... + 7580014938.
It is an arithmetic number, because the mean of its divisors is an integer number (50861765188520).
Almost surely, 2305125111142121 is an apocalyptic number.
It is an amenable number.
305125111142121 is a deficient number, since it is larger than the sum of its proper divisors (101769010366039).
305125111142121 is a wasteful number, since it uses less digits than its factorization.
305125111142121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15159996335.
The product of its (nonzero) digits is 2400, while the sum is 30.
Adding to 305125111142121 its reverse (121241111521503), we get a palindrome (426366222663624).
The spelling of 305125111142121 in words is "three hundred five trillion, one hundred twenty-five billion, one hundred eleven million, one hundred forty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.026 sec. • engine limits •