Base | Representation |
---|---|
bin | 10011010110110110110… |
… | …100001010110000000101 |
3 | 11201011111202121020220010 |
4 | 103112312310022300011 |
5 | 133243233234221201 |
6 | 2455031352100433 |
7 | 165050615432100 |
oct | 23266664126005 |
9 | 4634452536803 |
10 | 1330212023301 |
11 | 47315a010497 |
12 | 195979394719 |
13 | 985913962c5 |
14 | 4854dc25737 |
15 | 24906480bd6 |
hex | 135b6d0ac05 |
1330212023301 has 24 divisors (see below), whose sum is σ = 2086367880960. Its totient is φ = 751580461632.
The previous prime is 1330212023291. The next prime is 1330212023351. The reversal of 1330212023301 is 1033202120331.
It is not a de Polignac number, because 1330212023301 - 211 = 1330212021253 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1330212023351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 50824341 + ... + 50850506.
It is an arithmetic number, because the mean of its divisors is an integer number (86931995040).
Almost surely, 21330212023301 is an apocalyptic number.
It is an amenable number.
1330212023301 is a deficient number, since it is larger than the sum of its proper divisors (756155857659).
1330212023301 is a wasteful number, since it uses less digits than its factorization.
1330212023301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101674953 (or 101674946 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 1330212023301 its reverse (1033202120331), we get a palindrome (2363414143632).
The spelling of 1330212023301 in words is "one trillion, three hundred thirty billion, two hundred twelve million, twenty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •