Base | Representation |
---|---|
bin | 10011011000100011010… |
… | …110101011110110111010 |
3 | 11201100012200010000120210 |
4 | 103120203112223312322 |
5 | 133311000422324010 |
6 | 2455532202131550 |
7 | 165144006531363 |
oct | 23304326536672 |
9 | 4640180100523 |
10 | 1332033011130 |
11 | 473a039aa608 |
12 | 1961a71b0bb6 |
13 | 987c17242b3 |
14 | 48683a02b6a |
15 | 249b1282b20 |
hex | 136235abdba |
1332033011130 has 32 divisors (see below), whose sum is σ = 3210144303168. Its totient is φ = 353734905600.
The previous prime is 1332033011053. The next prime is 1332033011131. The reversal of 1332033011130 is 311103302331.
It is a junction number, because it is equal to n+sod(n) for n = 1332033011097 and 1332033011106.
It is not an unprimeable number, because it can be changed into a prime (1332033011131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 92111236 + ... + 92125695.
It is an arithmetic number, because the mean of its divisors is an integer number (100317009474).
Almost surely, 21332033011130 is an apocalyptic number.
1332033011130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1332033011130 is an abundant number, since it is smaller than the sum of its proper divisors (1878111292038).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1332033011130 is a wasteful number, since it uses less digits than its factorization.
1332033011130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 184237182.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 1332033011130 its reverse (311103302331), we get a palindrome (1643136313461).
The spelling of 1332033011130 in words is "one trillion, three hundred thirty-two billion, thirty-three million, eleven thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •