Base | Representation |
---|---|
bin | 10000011110011101100… |
… | …100100010100001001010 |
3 | 11000020110100200101001022 |
4 | 100132131210202201022 |
5 | 122022241310002310 |
6 | 2224045031552442 |
7 | 144541316132366 |
oct | 20363544424112 |
9 | 4006410611038 |
10 | 1132220000330 |
11 | 3a7198745141 |
12 | 16352222b722 |
13 | 829ca085323 |
14 | 3cb2a6b82a6 |
15 | 1e6b9447a55 |
hex | 1079d92284a |
1132220000330 has 16 divisors (see below), whose sum is σ = 2157878118600. Its totient is φ = 426247529472.
The previous prime is 1132220000311. The next prime is 1132220000341. The reversal of 1132220000330 is 330000222311.
It can be written as a sum of positive squares in 4 ways, for example, as 695667760489 + 436552239841 = 834067^2 + 660721^2 .
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1132220000299 and 1132220000308.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3330058655 + ... + 3330058994.
Almost surely, 21132220000330 is an apocalyptic number.
1132220000330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1132220000330 is a deficient number, since it is larger than the sum of its proper divisors (1025658118270).
1132220000330 is a wasteful number, since it uses less digits than its factorization.
1132220000330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6660117673.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 1132220000330 its reverse (330000222311), we get a palindrome (1462220222641).
The spelling of 1132220000330 in words is "one trillion, one hundred thirty-two billion, two hundred twenty million, three hundred thirty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •