Base | Representation |
---|---|
bin | 11010001000101001101… |
… | …00000101100000000000 |
3 | 10011211212222110121000000 |
4 | 31010110310011200000 |
5 | 104203044311110300 |
6 | 1524311224000000 |
7 | 121610132434200 |
oct | 15042464054000 |
9 | 3154788417000 |
10 | 897997363200 |
11 | 316925112163 |
12 | 126055600000 |
13 | 668b08ca812 |
14 | 3166b442400 |
15 | 1855b7e7c00 |
hex | d114d05800 |
897997363200 has 1512 divisors, whose sum is σ = 3891129818940. Its totient is φ = 204838502400.
The previous prime is 897997363199. The next prime is 897997363213. The reversal of 897997363200 is 2363799798.
It is a tau number, because it is divible by the number of its divisors (1512).
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 125 ways as a sum of consecutive naturals, for example, 1828914955 + ... + 1828915445.
Almost surely, 2897997363200 is an apocalyptic number.
897997363200 is a gapful number since it is divisible by the number (80) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 897997363200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1945564909470).
897997363200 is an abundant number, since it is smaller than the sum of its proper divisors (2993132455740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
897997363200 is an equidigital number, since it uses as much as digits as its factorization.
897997363200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 555 (or 508 counting only the distinct ones).
The product of its (nonzero) digits is 30862944, while the sum is 63.
The spelling of 897997363200 in words is "eight hundred ninety-seven billion, nine hundred ninety-seven million, three hundred sixty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •