Base | Representation |
---|---|
bin | 101101011111000000101111… |
… | …111001100100101100000100 |
3 | 222020021221110120210202201010 |
4 | 231133000233321210230010 |
5 | 202210001433300301012 |
6 | 1545242324432002220 |
7 | 60064433663543115 |
oct | 5537005771445404 |
9 | 866257416722633 |
10 | 200043200400132 |
11 | 58815932568381 |
12 | 1a529867090370 |
13 | 8780cba3c011b |
14 | 37581dd28220c |
15 | 181d8b1a02c3c |
hex | b5f02fe64b04 |
200043200400132 has 48 divisors (see below), whose sum is σ = 482864918175360. Its totient is φ = 64381450248192.
The previous prime is 200043200400053. The next prime is 200043200400149. The reversal of 200043200400132 is 231004002340002.
200043200400132 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 200043200400099 and 200043200400108.
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, 92563593 + ... + 94700079.
It is an arithmetic number, because the mean of its divisors is an integer number (10059685795320).
Almost surely, 2200043200400132 is an apocalyptic number.
It is an amenable number.
200043200400132 is an abundant number, since it is smaller than the sum of its proper divisors (282821717775228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200043200400132 is a wasteful number, since it uses less digits than its factorization.
200043200400132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2405580 (or 2405578 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 21.
Adding to 200043200400132 its reverse (231004002340002), we get a palindrome (431047202740134).
The spelling of 200043200400132 in words is "two hundred trillion, forty-three billion, two hundred million, four hundred thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •