Base | Representation |
---|---|
bin | 11101001010110011010… |
… | …11101011011001010101 |
3 | 10112210221021022212210201 |
4 | 32211121223223121111 |
5 | 112410032343032013 |
6 | 2044230302020501 |
7 | 132260146312615 |
oct | 16453153533125 |
9 | 3483837285721 |
10 | 1002232002133 |
11 | 35705392315a |
12 | 1422a5577731 |
13 | 7368282356b |
14 | 36718a54a45 |
15 | 1b10c6a53dd |
hex | e959aeb655 |
1002232002133 has 32 divisors (see below), whose sum is σ = 1066834581120. Its totient is φ = 940357693440.
The previous prime is 1002232002071. The next prime is 1002232002173. The reversal of 1002232002133 is 3312002322001.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1002232002133 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1002232002133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1002232002173) 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 31 ways as a sum of consecutive naturals, for example, 35234685 + ... + 35263117.
It is an arithmetic number, because the mean of its divisors is an integer number (33338580660).
Almost surely, 21002232002133 is an apocalyptic number.
It is an amenable number.
1002232002133 is a deficient number, since it is larger than the sum of its proper divisors (64602578987).
1002232002133 is a wasteful number, since it uses less digits than its factorization.
1002232002133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28837.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 1002232002133 its reverse (3312002322001), we get a palindrome (4314234324134).
The spelling of 1002232002133 in words is "one trillion, two billion, two hundred thirty-two million, two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •