Base | Representation |
---|---|
bin | 1100011101001001001… |
… | …0101010001001100000 |
3 | 202110022201221200110110 |
4 | 3013102102222021200 |
5 | 12001213231112341 |
6 | 242145102131320 |
7 | 21313442526423 |
oct | 3072222521140 |
9 | 673281850413 |
10 | 213981504096 |
11 | 82826a87168 |
12 | 35579b80b40 |
13 | 17241b53419 |
14 | a4dcd419ba |
15 | 5875b52216 |
hex | 31d24aa260 |
213981504096 has 24 divisors (see below), whose sum is σ = 561701448504. Its totient is φ = 71327168000.
The previous prime is 213981504043. The next prime is 213981504103. The reversal of 213981504096 is 690405189312.
213981504096 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (24).
It is a Smith number, since the sum of its digits (48) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1114486905 + ... + 1114487096.
It is an arithmetic number, because the mean of its divisors is an integer number (23404227021).
Almost surely, 2213981504096 is an apocalyptic number.
It is an amenable number.
213981504096 is an abundant number, since it is smaller than the sum of its proper divisors (347719944408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
213981504096 is a wasteful number, since it uses less digits than its factorization.
213981504096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2228974014 (or 2228974006 counting only the distinct ones).
The product of its (nonzero) digits is 466560, while the sum is 48.
The spelling of 213981504096 in words is "two hundred thirteen billion, nine hundred eighty-one million, five hundred four thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •