Base | Representation |
---|---|
bin | 1001001001110111011110… |
… | …11010010100011011011100 |
3 | 2122021102122120120212010211 |
4 | 10210323233122110123130 |
5 | 10114303204222344400 |
6 | 110451411311542204 |
7 | 4145234643464512 |
oct | 444735732243334 |
9 | 78242576525124 |
10 | 20130233403100 |
11 | 6461202a64397 |
12 | 231145a52a964 |
13 | b303716397c2 |
14 | 4d84467224b2 |
15 | 24d978450dba |
hex | 124eef6946dc |
20130233403100 has 36 divisors (see below), whose sum is σ = 43687888421184. Its totient is φ = 8051119732480.
The previous prime is 20130233403097. The next prime is 20130233403143. The reversal of 20130233403100 is 130433203102.
It is a super-2 number, since 2×201302334031002 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 11338924 + ... + 12993523.
It is an arithmetic number, because the mean of its divisors is an integer number (1213552456144).
Almost surely, 220130233403100 is an apocalyptic number.
20130233403100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20130233403100 is an abundant number, since it is smaller than the sum of its proper divisors (23557655018084).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20130233403100 is a wasteful number, since it uses less digits than its factorization.
20130233403100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24340734 (or 24340727 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 20130233403100 its reverse (130433203102), we get a palindrome (20260666606202).
The spelling of 20130233403100 in words is "twenty trillion, one hundred thirty billion, two hundred thirty-three million, four hundred three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •