Base | Representation |
---|---|
bin | 100000101001011100001… |
… | …110011011010011011000 |
3 | 21221110220210002111001212 |
4 | 200221130032123103120 |
5 | 243224212133323412 |
6 | 4434354200202252 |
7 | 321042344113103 |
oct | 40513416332330 |
9 | 7843823074055 |
10 | 2243520214232 |
11 | 795520744090 |
12 | 302986469388 |
13 | 13374202c1ab |
14 | 7a83087d73a |
15 | 3d55beda222 |
hex | 20a5c39b4d8 |
2243520214232 has 64 divisors (see below), whose sum is σ = 4747664793600. Its totient is φ = 984533200000.
The previous prime is 2243520214211. The next prime is 2243520214249. The reversal of 2243520214232 is 2324120253422.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 37206107 + ... + 37266357.
It is an arithmetic number, because the mean of its divisors is an integer number (74182262400).
Almost surely, 22243520214232 is an apocalyptic number.
2243520214232 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
2243520214232 is an abundant number, since it is smaller than the sum of its proper divisors (2504144579368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2243520214232 is a wasteful number, since it uses less digits than its factorization.
2243520214232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74888 (or 74884 counting only the distinct ones).
The product of its (nonzero) digits is 46080, while the sum is 32.
Adding to 2243520214232 its reverse (2324120253422), we get a palindrome (4567640467654).
The spelling of 2243520214232 in words is "two trillion, two hundred forty-three billion, five hundred twenty million, two hundred fourteen thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •