Base | Representation |
---|---|
bin | 11101001010000111101101… |
… | …00111101110011000111100 |
3 | 22102000202101212221102020121 |
4 | 32211003312213232120330 |
5 | 31401013022301402302 |
6 | 344212014450224324 |
7 | 16335321511221244 |
oct | 1645036647563074 |
9 | 272022355842217 |
10 | 64119409403452 |
11 | 19480986022977 |
12 | 72369305850a4 |
13 | 29a15853a8870 |
14 | 11b95787a2b24 |
15 | 762d5dc51e37 |
hex | 3a50f69ee63c |
64119409403452 has 24 divisors (see below), whose sum is σ = 120841336123200. Its totient is φ = 29593350540096.
The previous prime is 64119409403447. The next prime is 64119409403461. The reversal of 64119409403452 is 25430490491146.
It is a happy number.
It is a super-2 number, since 2×641194094034522 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (52).
It is a self number, because there is not a number n which added to its sum of digits gives 64119409403452.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2422074 + ... + 11580382.
It is an arithmetic number, because the mean of its divisors is an integer number (5035055671800).
Almost surely, 264119409403452 is an apocalyptic number.
It is an amenable number.
64119409403452 is a deficient number, since it is larger than the sum of its proper divisors (56721926719748).
64119409403452 is a wasteful number, since it uses less digits than its factorization.
64119409403452 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9292965 (or 9292963 counting only the distinct ones).
The product of its (nonzero) digits is 3732480, while the sum is 52.
Adding to 64119409403452 its reverse (25430490491146), we get a palindrome (89549899894598).
The spelling of 64119409403452 in words is "sixty-four trillion, one hundred nineteen billion, four hundred nine million, four hundred three thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •