Base | Representation |
---|---|
bin | 111111001011101… |
… | …0010000100100111 |
3 | 12110202012210221010 |
4 | 1332113102010213 |
5 | 13320212020201 |
6 | 550211353303 |
7 | 103351656630 |
oct | 17627220447 |
9 | 5422183833 |
10 | 2120032551 |
11 | 99878091a |
12 | 4b1bb2833 |
13 | 27a2b3040 |
14 | 1617c2887 |
15 | c61c2bd6 |
hex | 7e5d2127 |
2120032551 has 32 divisors (see below), whose sum is σ = 3563900928. Its totient is φ = 1090978560.
The previous prime is 2120032543. The next prime is 2120032573. The reversal of 2120032551 is 1552300212.
It is not a de Polignac number, because 2120032551 - 23 = 2120032543 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2120032511) 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 31 ways as a sum of consecutive naturals, for example, 83511 + ... + 105896.
It is an arithmetic number, because the mean of its divisors is an integer number (111371904).
Almost surely, 22120032551 is an apocalyptic number.
2120032551 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
2120032551 is a deficient number, since it is larger than the sum of its proper divisors (1443868377).
2120032551 is a wasteful number, since it uses less digits than its factorization.
2120032551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 189471.
The product of its (nonzero) digits is 600, while the sum is 21.
The square root of 2120032551 is about 46043.8112128004. The cubic root of 2120032551 is about 1284.6382325287.
Adding to 2120032551 its reverse (1552300212), we get a palindrome (3672332763).
The spelling of 2120032551 in words is "two billion, one hundred twenty million, thirty-two thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •