Base | Representation |
---|---|
bin | 10011011010111011000… |
… | …110111010001101110100 |
3 | 11201120210002212021211122 |
4 | 103122323012322031310 |
5 | 133331204211344333 |
6 | 2501032551523112 |
7 | 165264053301662 |
oct | 23327306721564 |
9 | 4646702767748 |
10 | 1334579012468 |
11 | 474aa0073049 |
12 | 196797989498 |
13 | 98b0903ba70 |
14 | 48845bc9c32 |
15 | 24aaea48798 |
hex | 136bb1ba374 |
1334579012468 has 12 divisors (see below), whose sum is σ = 2515168138980. Its totient is φ = 615959544192.
The previous prime is 1334579012423. The next prime is 1334579012479. The reversal of 1334579012468 is 8642109754331.
It can be written as a sum of positive squares in 2 ways, for example, as 208832548324 + 1125746464144 = 456982^2 + 1061012^2 .
It is a super-2 number, since 2×13345790124682 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 12832490453 + ... + 12832490556.
It is an arithmetic number, because the mean of its divisors is an integer number (209597344915).
It is a 1-persistent number, because it is pandigital, but 2⋅1334579012468 = 2669158024936 is not.
Almost surely, 21334579012468 is an apocalyptic number.
It is an amenable number.
1334579012468 is a deficient number, since it is larger than the sum of its proper divisors (1180589126512).
1334579012468 is a wasteful number, since it uses less digits than its factorization.
1334579012468 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25664981026 (or 25664981024 counting only the distinct ones).
The product of its (nonzero) digits is 4354560, while the sum is 53.
The spelling of 1334579012468 in words is "one trillion, three hundred thirty-four billion, five hundred seventy-nine million, twelve thousand, four hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •