Base | Representation |
---|---|
bin | 1110101001110100100111… |
… | …00111101100101101110000 |
3 | 11020002112000122222200220001 |
4 | 13110322103213230231300 |
5 | 13210421330223441422 |
6 | 152311104530555344 |
7 | 6534025640623000 |
oct | 724722347545560 |
9 | 136075018880801 |
10 | 32223321312112 |
11 | a2a3919902aa7 |
12 | 3745119138b54 |
13 | 14c9852802148 |
14 | 7d588d36a000 |
15 | 3ad308859227 |
hex | 1d4e939ecb70 |
32223321312112 has 40 divisors (see below), whose sum is σ = 72807795980000. Its totient is φ = 13809994845696.
The previous prime is 32223321312073. The next prime is 32223321312121. The reversal of 32223321312112 is 21121312332223.
It is a super-2 number, since 2×322233213121122 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2935792737 + ... + 2935803712.
It is an arithmetic number, because the mean of its divisors is an integer number (1820194899500).
Almost surely, 232223321312112 is an apocalyptic number.
It is an amenable number.
32223321312112 is an abundant number, since it is smaller than the sum of its proper divisors (40584474667888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32223321312112 is an equidigital number, since it uses as much as digits as its factorization.
32223321312112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5871596478 (or 5871596458 counting only the distinct ones).
The product of its digits is 5184, while the sum is 28.
Adding to 32223321312112 its reverse (21121312332223), we get a palindrome (53344633644335).
The spelling of 32223321312112 in words is "thirty-two trillion, two hundred twenty-three billion, three hundred twenty-one million, three hundred twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •