Base | Representation |
---|---|
bin | 10011010110110110010… |
… | …111000110000000100100 |
3 | 11201011111020021001000121 |
4 | 103112312113012000210 |
5 | 133243224311323300 |
6 | 2455030520451324 |
7 | 165050463566506 |
oct | 23266627060044 |
9 | 4634436231017 |
10 | 1330204401700 |
11 | 473155785249 |
12 | 195976919b44 |
13 | 9858c928195 |
14 | 4854cbddd76 |
15 | 2490597781a |
hex | 135b65c6024 |
1330204401700 has 108 divisors (see below), whose sum is σ = 2992467692032. Its totient is φ = 513226224000.
The previous prime is 1330204401661. The next prime is 1330204401709. The reversal of 1330204401700 is 71044020331.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (1330204401709) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 91409425 + ... + 91423975.
Almost surely, 21330204401700 is an apocalyptic number.
1330204401700 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1330204401700, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1496233846016).
1330204401700 is an abundant number, since it is smaller than the sum of its proper divisors (1662263290332).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1330204401700 is a wasteful number, since it uses less digits than its factorization.
1330204401700 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15710 (or 15674 counting only the distinct ones).
The product of its (nonzero) digits is 2016, while the sum is 25.
The spelling of 1330204401700 in words is "one trillion, three hundred thirty billion, two hundred four million, four hundred one thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •