Base | Representation |
---|---|
bin | 100010101101011100011100… |
… | …1100100011000001011110101 |
3 | 1111001000122020200120002220022 |
4 | 1011122320321210120023311 |
5 | 310004222021311303023 |
6 | 3001202505545414525 |
7 | 121211065014256013 |
oct | 10532707144301365 |
9 | 1431018220502808 |
10 | 305313011041013 |
11 | 89311580269a38 |
12 | 2a2ab85979a445 |
13 | 10148b7ca64001 |
14 | 555732b3218b3 |
15 | 2546d5ab227c8 |
hex | 115ae399182f5 |
305313011041013 has 8 divisors (see below), whose sum is σ = 310731389664000. Its totient is φ = 299933473842288.
The previous prime is 305313011041009. The next prime is 305313011041097. The reversal of 305313011041013 is 310140110313503.
It is a happy number.
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 305313011041013 - 22 = 305313011041009 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (305313011040013) 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, 9710340206 + ... + 9710371647.
It is an arithmetic number, because the mean of its divisors is an integer number (38841423708000).
Almost surely, 2305313011041013 is an apocalyptic number.
It is an amenable number.
305313011041013 is a deficient number, since it is larger than the sum of its proper divisors (5418378622987).
305313011041013 is a wasteful number, since it uses less digits than its factorization.
305313011041013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19420712131.
The product of its (nonzero) digits is 1620, while the sum is 26.
Adding to 305313011041013 its reverse (310140110313503), we get a palindrome (615453121354516).
The spelling of 305313011041013 in words is "three hundred five trillion, three hundred thirteen billion, eleven million, forty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •