Base | Representation |
---|---|
bin | 1011101001001010111… |
… | …0011001100001101010 |
3 | 201010022102222120021122 |
4 | 2322102232121201222 |
5 | 11234130203213310 |
6 | 231520443535242 |
7 | 20310635033240 |
oct | 2722256314152 |
9 | 633272876248 |
10 | 200030132330 |
11 | 77917882056 |
12 | 3292582a522 |
13 | 15b2a63c462 |
14 | 99780c6790 |
15 | 530ae27555 |
hex | 2e92b9986a |
200030132330 has 64 divisors (see below), whose sum is σ = 425771527680. Its totient is φ = 66202617600.
The previous prime is 200030132329. The next prime is 200030132347. The reversal of 200030132330 is 33231030002.
200030132330 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2000301323302 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 200030132299 and 200030132308.
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 31 ways as a sum of consecutive naturals, for example, 13940960 + ... + 13955300.
It is an arithmetic number, because the mean of its divisors is an integer number (6652680120).
Almost surely, 2200030132330 is an apocalyptic number.
200030132330 is an abundant number, since it is smaller than the sum of its proper divisors (225741395350).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200030132330 is a wasteful number, since it uses less digits than its factorization.
200030132330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21255.
The product of its (nonzero) digits is 324, while the sum is 17.
Adding to 200030132330 its reverse (33231030002), we get a palindrome (233261162332).
The spelling of 200030132330 in words is "two hundred billion, thirty million, one hundred thirty-two thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •