Base | Representation |
---|---|
bin | 10000000010010100111… |
… | …111001001100110101000 |
3 | 10220100111001111211101122 |
4 | 100002110333021212220 |
5 | 121023404332211102 |
6 | 2202131300434412 |
7 | 142421602505666 |
oct | 20022477114650 |
9 | 3810431454348 |
10 | 1102011210152 |
11 | 3953a6664a46 |
12 | 1596b13a8a08 |
13 | 7cbc4678c58 |
14 | 3b4a263dc36 |
15 | 1d9ec32a0a2 |
hex | 10094fc99a8 |
1102011210152 has 24 divisors (see below), whose sum is σ = 2180745873450. Its totient is φ = 522005308704.
The previous prime is 1102011210151. The next prime is 1102011210203. The reversal of 1102011210152 is 2510121102011.
It can be written as a sum of positive squares in only one way, i.e., 1093852423876 + 8158786276 = 1045874^2 + 90326^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 1102011210152.
It is not an unprimeable number, because it can be changed into a prime (1102011210151) by changing a digit.
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 5 ways as a sum of consecutive naturals, for example, 190788527 + ... + 190794302.
Almost surely, 21102011210152 is an apocalyptic number.
It is an amenable number.
1102011210152 is a deficient number, since it is larger than the sum of its proper divisors (1078734663298).
1102011210152 is a wasteful number, since it uses less digits than its factorization.
1102011210152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 381582873 (or 381582850 counting only the distinct ones).
The product of its (nonzero) digits is 40, while the sum is 17.
Adding to 1102011210152 its reverse (2510121102011), we get a palindrome (3612132312163).
The spelling of 1102011210152 in words is "one trillion, one hundred two billion, eleven million, two hundred ten thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.026 sec. • engine limits •