Base | Representation |
---|---|
bin | 10111101010101001001… |
… | …10111011101011011100 |
3 | 2212201221002122020202000 |
4 | 23311110212323223130 |
5 | 101310332041423004 |
6 | 1421321523002300 |
7 | 112515032412210 |
oct | 13652446735334 |
9 | 2781832566660 |
10 | 813168311004 |
11 | 293954348755 |
12 | 111720509390 |
13 | 5b8b218b98a |
14 | 2b5011c4940 |
15 | 162443ddc39 |
hex | bd549bbadc |
813168311004 has 48 divisors (see below), whose sum is σ = 2409387590400. Its totient is φ = 232333802928.
The previous prime is 813168310991. The next prime is 813168311041. The reversal of 813168311004 is 400113861318.
It is a super-2 number, since 2×8131683110042 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 813168311004.
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, 537808974 + ... + 537810485.
It is an arithmetic number, because the mean of its divisors is an integer number (50195574800).
Almost surely, 2813168311004 is an apocalyptic number.
813168311004 is a gapful number since it is divisible by the number (84) formed by its first and last digit.
It is an amenable number.
813168311004 is an abundant number, since it is smaller than the sum of its proper divisors (1596219279396).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
813168311004 is a wasteful number, since it uses less digits than its factorization.
813168311004 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1075619479 (or 1075619471 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 36.
The spelling of 813168311004 in words is "eight hundred thirteen billion, one hundred sixty-eight million, three hundred eleven thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •