Base | Representation |
---|---|
bin | 100100011001011… |
… | …1001010000110100 |
3 | 10011010002112102111 |
4 | 1020302321100310 |
5 | 10000123120200 |
6 | 321104420404 |
7 | 42156614122 |
oct | 11062712064 |
9 | 3133075374 |
10 | 1221301300 |
11 | 57743581a |
12 | 2a1017704 |
13 | 166041cbb |
14 | b82b6912 |
15 | 723470ba |
hex | 48cb9434 |
1221301300 has 18 divisors (see below), whose sum is σ = 2650224038. Its totient is φ = 488520480.
The previous prime is 1221301271. The next prime is 1221301307. The reversal of 1221301300 is 31031221.
It can be written as a sum of positive squares in 3 ways, for example, as 137311524 + 1083989776 = 11718^2 + 32924^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1221301307) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 6106407 + ... + 6106606.
Almost surely, 21221301300 is an apocalyptic number.
1221301300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1221301300 is an abundant number, since it is smaller than the sum of its proper divisors (1428922738).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1221301300 is a wasteful number, since it uses less digits than its factorization.
1221301300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12213027 (or 12213020 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 1221301300 is about 34947.1214837503. The cubic root of 1221301300 is about 1068.9095071027.
Adding to 1221301300 its reverse (31031221), we get a palindrome (1252332521).
The spelling of 1221301300 in words is "one billion, two hundred twenty-one million, three hundred one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •