Base | Representation |
---|---|
bin | 100001011101110… |
… | …1110010010100011 |
3 | 2220021000220000222 |
4 | 1002323232102203 |
5 | 4244433433410 |
6 | 303232433255 |
7 | 36553636400 |
oct | 10273562243 |
9 | 2807026028 |
10 | 1122952355 |
11 | 5269717a8 |
12 | 2740a882b |
13 | 14b858b65 |
14 | a91d52a7 |
15 | 688bb955 |
hex | 42eee4a3 |
1122952355 has 48 divisors (see below), whose sum is σ = 1648823040. Its totient is φ = 731001600.
The previous prime is 1122952343. The next prime is 1122952367. The reversal of 1122952355 is 5532592211.
It is an interprime number because it is at equal distance from previous prime (1122952343) and next prime (1122952367).
It is not a de Polignac number, because 1122952355 - 28 = 1122952099 is a prime.
It is a super-2 number, since 2×11229523552 = 2522043983200092050, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (35).
1122952355 is a Rhonda number in base 10.
Its product of digits (27000) is a multiple of the sum of its prime factors (2700).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 432110 + ... + 434700.
It is an arithmetic number, because the mean of its divisors is an integer number (34350480).
Almost surely, 21122952355 is an apocalyptic number.
1122952355 is a deficient number, since it is larger than the sum of its proper divisors (525870685).
1122952355 is a wasteful number, since it uses less digits than its factorization.
1122952355 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2700 (or 2693 counting only the distinct ones).
The product of its digits is 27000, while the sum is 35.
The square root of 1122952355 is about 33510.4812707905. The cubic root of 1122952355 is about 1039.4105248596.
The spelling of 1122952355 in words is "one billion, one hundred twenty-two million, nine hundred fifty-two thousand, three hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •