Base | Representation |
---|---|
bin | 10010111011101011101… |
… | …000111100100101111100 |
3 | 11121101012021001211221202 |
4 | 102323223220330211330 |
5 | 132304004034044400 |
6 | 2433404143115032 |
7 | 162665552211062 |
oct | 22735350744574 |
9 | 4541167054852 |
10 | 1301033503100 |
11 | 461846549391 |
12 | 1901955a2a78 |
13 | 958c1264c36 |
14 | 46d82938032 |
15 | 23c99a234d5 |
hex | 12eeba3c97c |
1301033503100 has 18 divisors (see below), whose sum is σ = 2823242701944. Its totient is φ = 520413401200.
The previous prime is 1301033503079. The next prime is 1301033503109. The reversal of 1301033503100 is 13053301031.
It is a super-2 number, since 2×13010335031002 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1301033503109) 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, 6505167416 + ... + 6505167615.
Almost surely, 21301033503100 is an apocalyptic number.
1301033503100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1301033503100 is an abundant number, since it is smaller than the sum of its proper divisors (1522209198844).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1301033503100 is a wasteful number, since it uses less digits than its factorization.
1301033503100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13010335045 (or 13010335038 counting only the distinct ones).
The product of its (nonzero) digits is 405, while the sum is 20.
Adding to 1301033503100 its reverse (13053301031), we get a palindrome (1314086804131).
The spelling of 1301033503100 in words is "one trillion, three hundred one billion, thirty-three million, five hundred three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •