Base | Representation |
---|---|
bin | 11101111111000101010… |
… | …11000011100011010101 |
3 | 10122111101101110001212220 |
4 | 32333202223003203111 |
5 | 113340023312340201 |
6 | 2105151403132553 |
7 | 134302540351053 |
oct | 16774253034325 |
9 | 3574341401786 |
10 | 1030300121301 |
11 | 367a47616560 |
12 | 147819514159 |
13 | 762068a19b9 |
14 | 37c1c6971d3 |
15 | 1bc018c5036 |
hex | efe2ac38d5 |
1030300121301 has 16 divisors (see below), whose sum is σ = 1498695524928. Its totient is φ = 624392163200.
The previous prime is 1030300121239. The next prime is 1030300121311. The reversal of 1030300121301 is 1031210030301.
It is a cyclic number.
It is not a de Polignac number, because 1030300121301 - 213 = 1030300113109 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030300121311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 145176 + ... + 1442801.
It is an arithmetic number, because the mean of its divisors is an integer number (93668470308).
Almost surely, 21030300121301 is an apocalyptic number.
1030300121301 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1030300121301 is a deficient number, since it is larger than the sum of its proper divisors (468395403627).
1030300121301 is a wasteful number, since it uses less digits than its factorization.
1030300121301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1607652.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 1030300121301 its reverse (1031210030301), we get a palindrome (2061510151602).
The spelling of 1030300121301 in words is "one trillion, thirty billion, three hundred million, one hundred twenty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •