Base | Representation |
---|---|
bin | 1100011001111101000111… |
… | …1100010001000000010010 |
3 | 1210021222100002002010120022 |
4 | 3012133101330101000102 |
5 | 3241434302102314414 |
6 | 45002052135543442 |
7 | 2605313663632415 |
oct | 306372174210022 |
9 | 53258302063508 |
10 | 13640043401234 |
11 | 43897899a5318 |
12 | 1643646b2ab82 |
13 | 77c334682b83 |
14 | 352278533b7c |
15 | 189c1ec1118e |
hex | c67d1f11012 |
13640043401234 has 8 divisors (see below), whose sum is σ = 20460083308860. Its totient is φ = 6820015631616.
The previous prime is 13640043401197. The next prime is 13640043401263. The reversal of 13640043401234 is 43210434004631.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 13391244954025 + 248798447209 = 3659405^2 + 498797^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×136400434012342 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13640043401194 and 13640043401203.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 688322 + ... + 5268194.
Almost surely, 213640043401234 is an apocalyptic number.
13640043401234 is a deficient number, since it is larger than the sum of its proper divisors (6820039907626).
13640043401234 is a wasteful number, since it uses less digits than its factorization.
13640043401234 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6069004.
The product of its (nonzero) digits is 82944, while the sum is 35.
Adding to 13640043401234 its reverse (43210434004631), we get a palindrome (56850477405865).
The spelling of 13640043401234 in words is "thirteen trillion, six hundred forty billion, forty-three million, four hundred one thousand, two hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •