Base | Representation |
---|---|
bin | 11101111110111001011… |
… | …01100000100110110100 |
3 | 10122111010102020112020102 |
4 | 32333130231200212310 |
5 | 113334322211220200 |
6 | 2105133431253232 |
7 | 134300214243416 |
oct | 16773455404664 |
9 | 3574112215212 |
10 | 1030200101300 |
11 | 3679a6110aa7 |
12 | 1477abb1a218 |
13 | 761bbc52076 |
14 | 37c0d29c9b6 |
15 | 1bbe7c196d5 |
hex | efdcb609b4 |
1030200101300 has 36 divisors (see below), whose sum is σ = 2235716071680. Its totient is φ = 412046519520.
The previous prime is 1030200101237. The next prime is 1030200101309. The reversal of 1030200101300 is 31010020301.
It is a super-2 number, since 2×10302001013002 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030200101309) 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 11 ways as a sum of consecutive naturals, for example, 835127 + ... + 1660673.
Almost surely, 21030200101300 is an apocalyptic number.
1030200101300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1030200101300 is an abundant number, since it is smaller than the sum of its proper divisors (1205515970380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1030200101300 is a wasteful number, since it uses less digits than its factorization.
1030200101300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 838040 (or 838033 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 11.
Adding to 1030200101300 its reverse (31010020301), we get a palindrome (1061210121601).
The spelling of 1030200101300 in words is "one trillion, thirty billion, two hundred million, one hundred one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •