Base | Representation |
---|---|
bin | 10011100011000000000… |
… | …011111000101001001000 |
3 | 11202102011112200202022100 |
4 | 103203000003320221020 |
5 | 134001440010242024 |
6 | 2505025332553400 |
7 | 166022015645211 |
oct | 23430003705110 |
9 | 4672145622270 |
10 | 1343252040264 |
11 | 478740838212 |
12 | 1983b8482860 |
13 | 9988bb39484 |
14 | 49029a0a408 |
15 | 24e1b1897c9 |
hex | 138c00f8a48 |
1343252040264 has 24 divisors (see below), whose sum is σ = 3637974275910. Its totient is φ = 447750680064.
The previous prime is 1343252040239. The next prime is 1343252040281. The reversal of 1343252040264 is 4620402523431.
1343252040264 is a `hidden beast` number, since 1 + 3 + 4 + 32 + 520 + 40 + 2 + 64 = 666.
It can be written as a sum of positive squares in only one way, i.e., 755407816164 + 587844224100 = 869142^2 + 766710^2 .
It is a tau number, because it is divible by the number of its divisors (24).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 9328139097 + ... + 9328139240.
Almost surely, 21343252040264 is an apocalyptic number.
It is an amenable number.
1343252040264 is an abundant number, since it is smaller than the sum of its proper divisors (2294722235646).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1343252040264 is a wasteful number, since it uses less digits than its factorization.
1343252040264 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18656278349 (or 18656278342 counting only the distinct ones).
The product of its (nonzero) digits is 138240, while the sum is 36.
Adding to 1343252040264 its reverse (4620402523431), we get a palindrome (5963654563695).
The spelling of 1343252040264 in words is "one trillion, three hundred forty-three billion, two hundred fifty-two million, forty thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •