Base | Representation |
---|---|
bin | 10010111111101010101… |
… | …110011011011000011011 |
3 | 11121210020111221102102011 |
4 | 102333222232123120123 |
5 | 132341240130130021 |
6 | 2435352542250351 |
7 | 163206606352342 |
oct | 22775256333033 |
9 | 4553214842364 |
10 | 1305313130011 |
11 | 463642261430 |
12 | 190b8a8869b7 |
13 | 96123aa0257 |
14 | 4726b07ab59 |
15 | 23e4a5d0de1 |
hex | 12feab9b61b |
1305313130011 has 8 divisors (see below), whose sum is σ = 1441134321984. Its totient is φ = 1172351331720.
The previous prime is 1305313129951. The next prime is 1305313130047. The reversal of 1305313130011 is 1100313135031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1305313130011 - 215 = 1305313097243 is a prime.
It is a super-2 number, since 2×13053131300112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1305313130111) 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, 714847461 + ... + 714849286.
It is an arithmetic number, because the mean of its divisors is an integer number (180141790248).
Almost surely, 21305313130011 is an apocalyptic number.
1305313130011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1305313130011 is a deficient number, since it is larger than the sum of its proper divisors (135821191973).
1305313130011 is a wasteful number, since it uses less digits than its factorization.
1305313130011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1429696841.
The product of its (nonzero) digits is 405, while the sum is 22.
Adding to 1305313130011 its reverse (1100313135031), we get a palindrome (2405626265042).
The spelling of 1305313130011 in words is "one trillion, three hundred five billion, three hundred thirteen million, one hundred thirty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •