Base | Representation |
---|---|
bin | 110100110100001110… |
… | …0010011011111000000 |
3 | 101211202112101002211121 |
4 | 1221220130103133000 |
5 | 3324241334300000 |
6 | 124034410122024 |
7 | 11123454664366 |
oct | 1515034233700 |
9 | 354675332747 |
10 | 113421400000 |
11 | 44113472617 |
12 | 19b94720314 |
13 | a9072a644c |
14 | 56bd761636 |
15 | 2e3c67ab1a |
hex | 1a687137c0 |
113421400000 has 84 divisors (see below), whose sum is σ = 281320728696. Its totient is φ = 45368480000.
The previous prime is 113421399983. The next prime is 113421400007. The reversal of 113421400000 is 4124311.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113421400007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 83554 + ... + 483553.
It is an arithmetic number, because the mean of its divisors is an integer number (3349056294).
Almost surely, 2113421400000 is an apocalyptic number.
113421400000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
113421400000 is an abundant number, since it is smaller than the sum of its proper divisors (167899328696).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113421400000 is an frugal number, since it uses more digits than its factorization.
113421400000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 567144 (or 567114 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 113421400000 its reverse (4124311), we get a palindrome (113425524311).
The spelling of 113421400000 in words is "one hundred thirteen billion, four hundred twenty-one million, four hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •