Base | Representation |
---|---|
bin | 1110101010000111000100… |
… | …01111111000111000010110 |
3 | 11020010110121020200210002121 |
4 | 13111003202033320320112 |
5 | 13211102123440431032 |
6 | 152315424105130154 |
7 | 6534526332544024 |
oct | 725034217707026 |
9 | 136113536623077 |
10 | 32233230405142 |
11 | a2a8044277288 |
12 | 374702378995a |
13 | 14ca7717108c0 |
14 | 7d614d3c7714 |
15 | 3ad6d875ba97 |
hex | 1d50e23f8e16 |
32233230405142 has 32 divisors (see below), whose sum is σ = 52278001443360. Its totient is φ = 14817182688000.
The previous prime is 32233230405133. The next prime is 32233230405161. The reversal of 32233230405142 is 24150403233223.
It is a super-3 number, since 3×322332304051423 (a number of 42 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 32233230405098 and 32233230405107.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 431389978 + ... + 431464690.
It is an arithmetic number, because the mean of its divisors is an integer number (1633687545105).
Almost surely, 232233230405142 is an apocalyptic number.
32233230405142 is a deficient number, since it is larger than the sum of its proper divisors (20044771038218).
32233230405142 is a wasteful number, since it uses less digits than its factorization.
32233230405142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 141088.
The product of its (nonzero) digits is 103680, while the sum is 34.
Adding to 32233230405142 its reverse (24150403233223), we get a palindrome (56383633638365).
The spelling of 32233230405142 in words is "thirty-two trillion, two hundred thirty-three billion, two hundred thirty million, four hundred five thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •