Base | Representation |
---|---|
bin | 10111101100011100100… |
… | …11111001100011111000 |
3 | 2212211102120021021100110 |
4 | 23312032103321203320 |
5 | 101314322404300440 |
6 | 1422001544304320 |
7 | 112551026135361 |
oct | 13661623714370 |
9 | 2784376237313 |
10 | 814136400120 |
11 | 2943008563aa |
12 | 1119507720a0 |
13 | 5ba07905184 |
14 | 2b5939c6b68 |
15 | 1629e3ba080 |
hex | bd8e4f98f8 |
814136400120 has 128 divisors (see below), whose sum is σ = 2532019875840. Its totient is φ = 209197777920.
The previous prime is 814136400113. The next prime is 814136400163. The reversal of 814136400120 is 21004631418.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 397117 + ... + 1336403.
It is an arithmetic number, because the mean of its divisors is an integer number (19781405280).
Almost surely, 2814136400120 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 814136400120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1266009937920).
814136400120 is an abundant number, since it is smaller than the sum of its proper divisors (1717883475720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
814136400120 is a wasteful number, since it uses less digits than its factorization.
814136400120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 939565 (or 939561 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 30.
The spelling of 814136400120 in words is "eight hundred fourteen billion, one hundred thirty-six million, four hundred thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.518 sec. • engine limits •