Base | Representation |
---|---|
bin | 10011010110101100000… |
… | …110010100101010001101 |
3 | 11201011001020021222002211 |
4 | 103112230012110222031 |
5 | 133242401222424401 |
6 | 2455001450350421 |
7 | 165043303306315 |
oct | 23265406245215 |
9 | 4634036258084 |
10 | 1330032233101 |
11 | 473077581450 |
12 | 19592912b411 |
13 | 98563066a80 |
14 | 48533dc4445 |
15 | 248e57b9951 |
hex | 135ac194a8d |
1330032233101 has 16 divisors (see below), whose sum is σ = 1644795109440. Its totient is φ = 1057368280320.
The previous prime is 1330032233093. The next prime is 1330032233119. The reversal of 1330032233101 is 1013322300331.
It is not a de Polignac number, because 1330032233101 - 23 = 1330032233093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1330032233801) 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 15 ways as a sum of consecutive naturals, for example, 244758460 + ... + 244763893.
It is an arithmetic number, because the mean of its divisors is an integer number (102799694340).
Almost surely, 21330032233101 is an apocalyptic number.
1330032233101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1330032233101 is a deficient number, since it is larger than the sum of its proper divisors (314762876339).
1330032233101 is a wasteful number, since it uses less digits than its factorization.
1330032233101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 489522396.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 1330032233101 its reverse (1013322300331), we get a palindrome (2343354533432).
The spelling of 1330032233101 in words is "one trillion, three hundred thirty billion, thirty-two million, two hundred thirty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •