Base | Representation |
---|---|
bin | 10000010011000101001… |
… | …101101111010001010010 |
3 | 10222001220201222201001100 |
4 | 100103011031233101102 |
5 | 121322230023210002 |
6 | 2214304311245230 |
7 | 143626435464462 |
oct | 20230515572122 |
9 | 3861821881040 |
10 | 1120000210002 |
11 | 3a1a97a13873 |
12 | 161091979816 |
13 | 8180052766b |
14 | 3c2cb805ba2 |
15 | 1e20175e11c |
hex | 104c536f452 |
1120000210002 has 96 divisors (see below), whose sum is σ = 2547966356208. Its totient is φ = 355170037248.
The previous prime is 1120000210001. The next prime is 1120000210009. The reversal of 1120000210002 is 2000120000211.
It can be written as a sum of positive squares in 8 ways, for example, as 843754310721 + 276245899281 = 918561^2 + 525591^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (1120000210001) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 10288168 + ... + 10396460.
Almost surely, 21120000210002 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1120000210002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1273983178104).
1120000210002 is an abundant number, since it is smaller than the sum of its proper divisors (1427966146206).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1120000210002 is a wasteful number, since it uses less digits than its factorization.
1120000210002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 108684 (or 108681 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 1120000210002 its reverse (2000120000211), we get a palindrome (3120120210213).
The spelling of 1120000210002 in words is "one trillion, one hundred twenty billion, two hundred ten thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •