Base | Representation |
---|---|
bin | 1010100011010000… |
… | …1010001010100011 |
3 | 21022101100222022012 |
4 | 2220310022022203 |
5 | 21300023323121 |
6 | 1145012503135 |
7 | 130120455152 |
oct | 25064121243 |
9 | 7271328265 |
10 | 2832245411 |
11 | 1223801996 |
12 | 67061aaab |
13 | 361a0a278 |
14 | 1cc219599 |
15 | 1189a8c5b |
hex | a8d0a2a3 |
2832245411 has 4 divisors (see below), whose sum is σ = 2846478000. Its totient is φ = 2818012824.
The previous prime is 2832245399. The next prime is 2832245539. The reversal of 2832245411 is 1145422382.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2832245411 is a prime.
It is a super-2 number, since 2×28322454112 = 16043228136261117842, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2832245011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7115996 + ... + 7116393.
It is an arithmetic number, because the mean of its divisors is an integer number (711619500).
Almost surely, 22832245411 is an apocalyptic number.
2832245411 is a deficient number, since it is larger than the sum of its proper divisors (14232589).
2832245411 is a wasteful number, since it uses less digits than its factorization.
2832245411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14232588.
The product of its digits is 15360, while the sum is 32.
The square root of 2832245411 is about 53218.8445101921. The cubic root of 2832245411 is about 1414.8496572653.
Adding to 2832245411 its reverse (1145422382), we get a palindrome (3977667793).
The spelling of 2832245411 in words is "two billion, eight hundred thirty-two million, two hundred forty-five thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •