Base | Representation |
---|---|
bin | 11110000010011111110… |
… | …11101111000001100101 |
3 | 10122200010010201122010211 |
4 | 33001033323233001211 |
5 | 113402302100211323 |
6 | 2110053324415421 |
7 | 134366136350440 |
oct | 17011773570145 |
9 | 3580103648124 |
10 | 1032133210213 |
11 | 3687a8320376 |
12 | 14804b3a7571 |
13 | 764395a89b1 |
14 | 37d53d04657 |
15 | 1bcac7b770d |
hex | f04feef065 |
1032133210213 has 8 divisors (see below), whose sum is σ = 1180553270528. Its totient is φ = 883956264624.
The previous prime is 1032133210193. The next prime is 1032133210291. The reversal of 1032133210213 is 3120123312301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1032133210213 - 225 = 1032099655781 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 (1032133210313) 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 7 ways as a sum of consecutive naturals, for example, 60769581 + ... + 60786562.
It is an arithmetic number, because the mean of its divisors is an integer number (147569158816).
Almost surely, 21032133210213 is an apocalyptic number.
It is an amenable number.
1032133210213 is a deficient number, since it is larger than the sum of its proper divisors (148420060315).
1032133210213 is a wasteful number, since it uses less digits than its factorization.
1032133210213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121557363.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 1032133210213 its reverse (3120123312301), we get a palindrome (4152256522514).
The spelling of 1032133210213 in words is "one trillion, thirty-two billion, one hundred thirty-three million, two hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •