Base | Representation |
---|---|
bin | 10010010111100000101… |
… | …11010010111011010101 |
3 | 2020022222021222020000000 |
4 | 21023300113102323111 |
5 | 40314442023121033 |
6 | 1201531121241513 |
7 | 63411123222150 |
oct | 11136027227325 |
9 | 2208867866000 |
10 | 631097863893 |
11 | 223713322a62 |
12 | a2389493299 |
13 | 47687605bc3 |
14 | 2278c432c97 |
15 | 1163a059a13 |
hex | 92f05d2ed5 |
631097863893 has 64 divisors (see below), whose sum is σ = 1138650163200. Its totient is φ = 341646806448.
The previous prime is 631097863873. The next prime is 631097863933. The reversal of 631097863893 is 398368790136.
It is not a de Polignac number, because 631097863893 - 26 = 631097863829 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a self number, because there is not a number n which added to its sum of digits gives 631097863893.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (631097863853) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 793971 + ... + 1375712.
It is an arithmetic number, because the mean of its divisors is an integer number (17791408800).
Almost surely, 2631097863893 is an apocalyptic number.
631097863893 is a gapful number since it is divisible by the number (63) formed by its first and last digit.
It is an amenable number.
631097863893 is a deficient number, since it is larger than the sum of its proper divisors (507552299307).
631097863893 is an equidigital number, since it uses as much as digits as its factorization.
631097863893 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2169730 (or 2169712 counting only the distinct ones).
The product of its (nonzero) digits is 35271936, while the sum is 63.
The spelling of 631097863893 in words is "six hundred thirty-one billion, ninety-seven million, eight hundred sixty-three thousand, eight hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •