Base | Representation |
---|---|
bin | 101110001101011010100101… |
… | …000001110010010100101000 |
3 | 222122120210101200120122022122 |
4 | 232031122211001302110220 |
5 | 203114223144443033112 |
6 | 2000123301203210412 |
7 | 60544013122361642 |
oct | 5615324501622450 |
9 | 878523350518278 |
10 | 203232031221032 |
11 | 59835247415720 |
12 | 1a963890076a08 |
13 | 895291025c078 |
14 | 38286a8b0b892 |
15 | 18767e8d5e872 |
hex | b8d6a5072528 |
203232031221032 has 64 divisors (see below), whose sum is σ = 429118042429440. Its totient is φ = 89396916235200.
The previous prime is 203232031221019. The next prime is 203232031221041. The reversal of 203232031221032 is 230122130232302.
It is a junction number, because it is equal to n+sod(n) for n = 203232031220992 and 203232031221010.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 194221943 + ... + 195265529.
It is an arithmetic number, because the mean of its divisors is an integer number (6704969412960).
Almost surely, 2203232031221032 is an apocalyptic number.
203232031221032 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
203232031221032 is an abundant number, since it is smaller than the sum of its proper divisors (225886011208408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
203232031221032 is a wasteful number, since it uses less digits than its factorization.
203232031221032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1115022 (or 1115018 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 203232031221032 its reverse (230122130232302), we get a palindrome (433354161453334).
The spelling of 203232031221032 in words is "two hundred three trillion, two hundred thirty-two billion, thirty-one million, two hundred twenty-one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •