Base | Representation |
---|---|
bin | 11110111110110010110… |
… | …10100110111111011001 |
3 | 10202202200011010020212121 |
4 | 33133121122212333121 |
5 | 114420101131202213 |
6 | 2133005430541241 |
7 | 136623262260406 |
oct | 17373132467731 |
9 | 3682604106777 |
10 | 1064504553433 |
11 | 3804aa083692 |
12 | 152384507821 |
13 | 794c8034c59 |
14 | 3974526d2ad |
15 | 1ca546a688d |
hex | f7d96a6fd9 |
1064504553433 has 8 divisors (see below), whose sum is σ = 1111155364800. Its totient is φ = 1017884409168.
The previous prime is 1064504553389. The next prime is 1064504553439. The reversal of 1064504553433 is 3343554054601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1064504553433 is a prime.
It is a super-2 number, since 2×10645045534332 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1064504553433.
It is not an unprimeable number, because it can be changed into a prime (1064504553439) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7595818 + ... + 7734691.
It is an arithmetic number, because the mean of its divisors is an integer number (138894420600).
Almost surely, 21064504553433 is an apocalyptic number.
It is an amenable number.
1064504553433 is a deficient number, since it is larger than the sum of its proper divisors (46650811367).
1064504553433 is a wasteful number, since it uses less digits than its factorization.
1064504553433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15333551.
The product of its (nonzero) digits is 1296000, while the sum is 43.
The spelling of 1064504553433 in words is "one trillion, sixty-four billion, five hundred four million, five hundred fifty-three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •