Base | Representation |
---|---|
bin | 11100100101011001110… |
… | …110001011111001010011 |
3 | 20221210012221222110221220 |
4 | 130211121312023321103 |
5 | 224140400200242440 |
6 | 4102220153220123 |
7 | 261626240450100 |
oct | 34453166137123 |
9 | 6853187873856 |
10 | 1964307430995 |
11 | 698070376478 |
12 | 278842701643 |
13 | 113305a03760 |
14 | 6b1043c1aa7 |
15 | 361697468d0 |
hex | 1c959d8be53 |
1964307430995 has 96 divisors (see below), whose sum is σ = 3992704773120. Its totient is φ = 817219710720.
The previous prime is 1964307430993. The next prime is 1964307431003. The reversal of 1964307430995 is 5990347034691.
It is a happy number.
It is not a de Polignac number, because 1964307430995 - 21 = 1964307430993 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1964307430991) by changing a digit.
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 95 ways as a sum of consecutive naturals, for example, 769335 + ... + 2126144.
It is an arithmetic number, because the mean of its divisors is an integer number (41590674720).
Almost surely, 21964307430995 is an apocalyptic number.
1964307430995 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1964307430995 is an abundant number, since it is smaller than the sum of its proper divisors (2028397342125).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1964307430995 is a wasteful number, since it uses less digits than its factorization.
1964307430995 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2895585 (or 2895578 counting only the distinct ones).
The product of its (nonzero) digits is 22044960, while the sum is 60.
The spelling of 1964307430995 in words is "one trillion, nine hundred sixty-four billion, three hundred seven million, four hundred thirty thousand, nine hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •