Base | Representation |
---|---|
bin | 111100110011100… |
… | …1101010011010010 |
3 | 12021012020001120010 |
4 | 1321213031103102 |
5 | 13134310234414 |
6 | 534243055350 |
7 | 101363305260 |
oct | 17147152322 |
9 | 5235201503 |
10 | 2040321234 |
11 | 9577875a6 |
12 | 48b371556 |
13 | 266924193 |
14 | 154d93430 |
15 | be1c9959 |
hex | 799cd4d2 |
2040321234 has 32 divisors (see below), whose sum is σ = 4814032896. Its totient is φ = 564143760.
The previous prime is 2040321223. The next prime is 2040321247. The reversal of 2040321234 is 4321230402.
It is a super-2 number, since 2×20403212342 = 8325821475822565512, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 2040321234.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 782232 + ... + 784835.
It is an arithmetic number, because the mean of its divisors is an integer number (150438528).
Almost surely, 22040321234 is an apocalyptic number.
2040321234 is an abundant number, since it is smaller than the sum of its proper divisors (2773711662).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2040321234 is a wasteful number, since it uses less digits than its factorization.
2040321234 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1567110.
The product of its (nonzero) digits is 1152, while the sum is 21.
The square root of 2040321234 is about 45169.9151427142. The cubic root of 2040321234 is about 1268.3317078256.
Adding to 2040321234 its reverse (4321230402), we get a palindrome (6361551636).
The spelling of 2040321234 in words is "two billion, forty million, three hundred twenty-one thousand, two hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •