Base | Representation |
---|---|
bin | 10011010110101010010… |
… | …011000010110000011100 |
3 | 11201010222010102122012200 |
4 | 103112222103002300130 |
5 | 133242321003410322 |
6 | 2454554450531500 |
7 | 165042455403555 |
oct | 23265223026034 |
9 | 4633863378180 |
10 | 1330002013212 |
11 | 473061510834 |
12 | 19591ab96b90 |
13 | 98559a15992 |
14 | 4852dd9932c |
15 | 248e2cea8ac |
hex | 135aa4c2c1c |
1330002013212 has 72 divisors (see below), whose sum is σ = 3420383602272. Its totient is φ = 435642537600.
The previous prime is 1330002013181. The next prime is 1330002013229. The reversal of 1330002013212 is 2123102000331.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1970358 + ... + 2557794.
Almost surely, 21330002013212 is an apocalyptic number.
1330002013212 is a gapful number since it is divisible by the number (12) 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 1330002013212, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1710191801136).
1330002013212 is an abundant number, since it is smaller than the sum of its proper divisors (2090381589060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1330002013212 is a wasteful number, since it uses less digits than its factorization.
1330002013212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 588539 (or 588534 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 1330002013212 its reverse (2123102000331), we get a palindrome (3453104013543).
The spelling of 1330002013212 in words is "one trillion, three hundred thirty billion, two million, thirteen thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •