Base | Representation |
---|---|
bin | 110101000000011111011010… |
… | …110000111110001000110110 |
3 | 1010120110000210111010000000110 |
4 | 311000133122300332020312 |
5 | 221024101122213130402 |
6 | 2143454311352523450 |
7 | 100051046455064142 |
oct | 6500373260761066 |
9 | 1116400714100013 |
10 | 233130200130102 |
11 | 68311a65310990 |
12 | 221922403b0586 |
13 | a011111704112 |
14 | 417d7c1b8a222 |
15 | 1be43b8ca356c |
hex | d407dac3e236 |
233130200130102 has 32 divisors (see below), whose sum is σ = 508981687079040. Its totient is φ = 70599129398720.
The previous prime is 233130200129999. The next prime is 233130200130151. The reversal of 233130200130102 is 201031002031332.
233130200130102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
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, 1159543527 + ... + 1159744562.
It is an arithmetic number, because the mean of its divisors is an integer number (15905677721220).
Almost surely, 2233130200130102 is an apocalyptic number.
233130200130102 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
233130200130102 is an abundant number, since it is smaller than the sum of its proper divisors (275851486948938).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
233130200130102 is a wasteful number, since it uses less digits than its factorization.
233130200130102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2319289628.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 233130200130102 its reverse (201031002031332), we get a palindrome (434161202161434).
The spelling of 233130200130102 in words is "two hundred thirty-three trillion, one hundred thirty billion, two hundred million, one hundred thirty thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •