Base | Representation |
---|---|
bin | 110100110010001011… |
… | …1100010000010000000 |
3 | 101211120202202001112202 |
4 | 1221210113202002000 |
5 | 3324121334240000 |
6 | 124023525012332 |
7 | 11121664641164 |
oct | 1514427420200 |
9 | 354522661482 |
10 | 113353040000 |
11 | 44088921752 |
12 | 19b758540a8 |
13 | a8c6090245 |
14 | 56b4648ca4 |
15 | 2e36675dd5 |
hex | 1a645e2080 |
113353040000 has 80 divisors (see below), whose sum is σ = 282185507670. Its totient is φ = 45341184000.
The previous prime is 113353039997. The next prime is 113353040033. The reversal of 113353040000 is 40353311.
It is a happy number.
It can be written as a sum of positive squares in 5 ways, for example, as 16422935104 + 96930104896 = 128152^2 + 311336^2 .
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 628457 + ... + 788456.
Almost surely, 2113353040000 is an apocalyptic number.
113353040000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
113353040000 is an abundant number, since it is smaller than the sum of its proper divisors (168832467670).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113353040000 is an frugal number, since it uses more digits than its factorization.
113353040000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1416947 (or 1416920 counting only the distinct ones).
The product of its (nonzero) digits is 540, while the sum is 20.
Adding to 113353040000 its reverse (40353311), we get a palindrome (113393393311).
The spelling of 113353040000 in words is "one hundred thirteen billion, three hundred fifty-three million, forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •