Base | Representation |
---|---|
bin | 1001010011100110101010… |
… | …0101000111000010100100 |
3 | 1100020012121120020020202112 |
4 | 2110321222211013002210 |
5 | 2320121423423242012 |
6 | 33432411052100152 |
7 | 2104160262506210 |
oct | 224715245070244 |
9 | 40205546206675 |
10 | 10232400212132 |
11 | 329559a18613a |
12 | 1193136164658 |
13 | 592bacba0b47 |
14 | 275372331940 |
15 | 12b27caaa122 |
hex | 94e6a9470a4 |
10232400212132 has 12 divisors (see below), whose sum is σ = 20464800424320. Its totient is φ = 4385314376616.
The previous prime is 10232400212129. The next prime is 10232400212141. The reversal of 10232400212132 is 23121200423201.
10232400212132 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 10232400212098 and 10232400212107.
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 3 ways as a sum of consecutive naturals, for example, 182721432332 + ... + 182721432387.
It is an arithmetic number, because the mean of its divisors is an integer number (1705400035360).
Almost surely, 210232400212132 is an apocalyptic number.
It is an amenable number.
10232400212132 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10232400212132 is a wasteful number, since it uses less digits than its factorization.
10232400212132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 365442864730 (or 365442864728 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 10232400212132 its reverse (23121200423201), we get a palindrome (33353600635333).
The spelling of 10232400212132 in words is "ten trillion, two hundred thirty-two billion, four hundred million, two hundred twelve thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •