Base | Representation |
---|---|
bin | 101111111101111110… |
… | …0111011011110110100 |
3 | 100211220000221022001111 |
4 | 1133323330323132310 |
5 | 3141431343120200 |
6 | 115153413404404 |
7 | 10304500420405 |
oct | 1377374733664 |
9 | 324800838044 |
10 | 103011301300 |
11 | 3a761215366 |
12 | 17b6a339704 |
13 | 993864cc2b |
14 | 4db2d699ac |
15 | 2a2d7b20ba |
hex | 17fbf3b7b4 |
103011301300 has 18 divisors (see below), whose sum is σ = 223534524038. Its totient is φ = 41204520480.
The previous prime is 103011301291. The next prime is 103011301301. The reversal of 103011301300 is 3103110301.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 24698636964 + 78312664336 = 157158^2 + 279844^2 .
It is a super-2 number, since 2×1030113013002 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103011301301) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 515056407 + ... + 515056606.
Almost surely, 2103011301300 is an apocalyptic number.
103011301300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103011301300 is an abundant number, since it is smaller than the sum of its proper divisors (120523222738).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103011301300 is a wasteful number, since it uses less digits than its factorization.
103011301300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1030113027 (or 1030113020 counting only the distinct ones).
The product of its (nonzero) digits is 27, while the sum is 13.
Adding to 103011301300 its reverse (3103110301), we get a palindrome (106114411601).
The spelling of 103011301300 in words is "one hundred three billion, eleven million, three hundred one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •