Base | Representation |
---|---|
bin | 10011001110011101101… |
… | …010001011110101010100 |
3 | 11200022020200222010122222 |
4 | 103032131222023311110 |
5 | 133121304202310200 |
6 | 2450541222041512 |
7 | 164311366025066 |
oct | 23163552136524 |
9 | 4608220863588 |
10 | 1321200041300 |
11 | 46a354a85a87 |
12 | 194083279298 |
13 | 977862ac289 |
14 | 47d36db1736 |
15 | 2457a1d8d85 |
hex | 1339da8bd54 |
1321200041300 has 36 divisors (see below), whose sum is σ = 2875511593500. Its totient is φ = 526911813120.
The previous prime is 1321200041299. The next prime is 1321200041327. The reversal of 1321200041300 is 31400021231.
It can be written as a sum of positive squares in 6 ways, for example, as 52972704964 + 1268227336336 = 230158^2 + 1126156^2 .
It is a super-3 number, since 3×13212000413003 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 19568675 + ... + 19636074.
Almost surely, 21321200041300 is an apocalyptic number.
1321200041300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1321200041300 is an abundant number, since it is smaller than the sum of its proper divisors (1554311552200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1321200041300 is a wasteful number, since it uses less digits than its factorization.
1321200041300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39205100 (or 39205093 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 1321200041300 its reverse (31400021231), we get a palindrome (1352600062531).
The spelling of 1321200041300 in words is "one trillion, three hundred twenty-one billion, two hundred million, forty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •