Base | Representation |
---|---|
bin | 101101101101010111110111… |
… | …110000100110101100011000 |
3 | 222100210021211101101212112121 |
4 | 231231113313300212230120 |
5 | 202322134121324044112 |
6 | 1551315541540551024 |
7 | 60225642210343060 |
oct | 5555276760465430 |
9 | 870707741355477 |
10 | 201030101003032 |
11 | 59066429199354 |
12 | 1a668b920b2474 |
13 | 8823098824a02 |
14 | 378dca1a883a0 |
15 | 18393c3231407 |
hex | b6d5f7c26b18 |
201030101003032 has 32 divisors (see below), whose sum is σ = 430849512414720. Its totient is φ = 86141612662560.
The previous prime is 201030101003029. The next prime is 201030101003089. The reversal of 201030101003032 is 230300101030102.
It is a junction number, because it is equal to n+sod(n) for n = 201030101002997 and 201030101003015.
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, 294341488 + ... + 295023679.
It is an arithmetic number, because the mean of its divisors is an integer number (13464047262960).
Almost surely, 2201030101003032 is an apocalyptic number.
It is an amenable number.
201030101003032 is an abundant number, since it is smaller than the sum of its proper divisors (229819411411688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201030101003032 is a wasteful number, since it uses less digits than its factorization.
201030101003032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 589371271 (or 589371267 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 201030101003032 its reverse (230300101030102), we get a palindrome (431330202033134).
The spelling of 201030101003032 in words is "two hundred one trillion, thirty billion, one hundred one million, three thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •