Base | Representation |
---|---|
bin | 10011010110111100110… |
… | …001100101100101110100 |
3 | 11201011202201202002222220 |
4 | 103112330301211211310 |
5 | 133243434333310400 |
6 | 2455045323122340 |
7 | 165053241340563 |
oct | 23267461454564 |
9 | 4634681662886 |
10 | 1330312010100 |
11 | 4732004a3007 |
12 | 1959a69733b0 |
13 | 985a9003aa8 |
14 | 4855d211bda |
15 | 249101317a0 |
hex | 135bcc65974 |
1330312010100 has 36 divisors (see below), whose sum is σ = 3849036083424. Its totient is φ = 354749869280.
The previous prime is 1330312010081. The next prime is 1330312010117. The reversal of 1330312010100 is 10102130331.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 1330312010100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2217186384 + ... + 2217186983.
It is an arithmetic number, because the mean of its divisors is an integer number (106917668984).
Almost surely, 21330312010100 is an apocalyptic number.
1330312010100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1330312010100 is an abundant number, since it is smaller than the sum of its proper divisors (2518724073324).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1330312010100 is a wasteful number, since it uses less digits than its factorization.
1330312010100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4434373384 (or 4434373377 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 1330312010100 its reverse (10102130331), we get a palindrome (1340414140431).
The spelling of 1330312010100 in words is "one trillion, three hundred thirty billion, three hundred twelve million, ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.193 sec. • engine limits •