Base | Representation |
---|---|
bin | 100010101011001101000111… |
… | …1011001110000001111101001 |
3 | 1110222221012202202002110220000 |
4 | 1011112122033121300033221 |
5 | 304434201134120414431 |
6 | 3000405243303053213 |
7 | 121146620344026432 |
oct | 10526321731601751 |
9 | 1428835682073800 |
10 | 305005213451241 |
11 | 89202a91584076 |
12 | 2a260078a41209 |
13 | 10125b39611674 |
14 | 554648c764489 |
15 | 253dd43aeb9e6 |
hex | 115668f6703e9 |
305005213451241 has 20 divisors (see below), whose sum is σ = 459883250201232. Its totient is φ = 201436464952728.
The previous prime is 305005213451221. The next prime is 305005213451243. The reversal of 305005213451241 is 142154312500503.
305005213451241 is a `hidden beast` number, since 3 + 0 + 5 + 0 + 0 + 5 + 2 + 134 + 512 + 4 + 1 = 666.
It is not a de Polignac number, because 305005213451241 - 218 = 305005213189097 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 305005213451196 and 305005213451205.
It is not an unprimeable number, because it can be changed into a prime (305005213451243) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 17595769195 + ... + 17595786528.
Almost surely, 2305005213451241 is an apocalyptic number.
It is an amenable number.
305005213451241 is a deficient number, since it is larger than the sum of its proper divisors (154878036749991).
305005213451241 is a wasteful number, since it uses less digits than its factorization.
305005213451241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35191555842 (or 35191555833 counting only the distinct ones).
The product of its (nonzero) digits is 72000, while the sum is 36.
Adding to 305005213451241 its reverse (142154312500503), we get a palindrome (447159525951744).
The spelling of 305005213451241 in words is "three hundred five trillion, five billion, two hundred thirteen million, four hundred fifty-one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •