Base | Representation |
---|---|
bin | 11101111110101101100… |
… | …00110101110100000100 |
3 | 10122110212110110200002111 |
4 | 32333112300311310010 |
5 | 113334121134430200 |
6 | 2105115504350404 |
7 | 134264563114444 |
oct | 16772660656404 |
9 | 3573773420074 |
10 | 1030100311300 |
11 | 367954853325 |
12 | 147782615404 |
13 | 761a4383028 |
14 | 37bddd24124 |
15 | 1bbde0a70ba |
hex | efd6c35d04 |
1030100311300 has 72 divisors (see below), whose sum is σ = 2356519173120. Its totient is φ = 390264441600.
The previous prime is 1030100311297. The next prime is 1030100311301. The reversal of 1030100311300 is 31130010301.
It is a happy number.
It is a super-2 number, since 2×10301003113002 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1030100311301) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3389305 + ... + 3680704.
It is an arithmetic number, because the mean of its divisors is an integer number (32729432960).
Almost surely, 21030100311300 is an apocalyptic number.
1030100311300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1030100311300 is an abundant number, since it is smaller than the sum of its proper divisors (1326418861820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1030100311300 is a wasteful number, since it uses less digits than its factorization.
1030100311300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7070101 (or 7070094 counting only the distinct ones).
The product of its (nonzero) digits is 27, while the sum is 13.
Adding to 1030100311300 its reverse (31130010301), we get a palindrome (1061230321601).
The spelling of 1030100311300 in words is "one trillion, thirty billion, one hundred million, three hundred eleven thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •