Base | Representation |
---|---|
bin | 10001110001001001010… |
… | …101100011110010100101 |
3 | 11022201121122222112212202 |
4 | 101301021111203302211 |
5 | 130001102240203303 |
6 | 2332530431024245 |
7 | 154133355053111 |
oct | 21611125436245 |
9 | 4281548875782 |
10 | 1221001100453 |
11 | 430907320762 |
12 | 17877a96b085 |
13 | 8b1a84c6674 |
14 | 4314d766741 |
15 | 21b637a3c88 |
hex | 11c49563ca5 |
1221001100453 has 8 divisors (see below), whose sum is σ = 1230337693056. Its totient is φ = 1211680962000.
The previous prime is 1221001100393. The next prime is 1221001100477. The reversal of 1221001100453 is 3540011001221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1221001100453 - 28 = 1221001100197 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1221001106453) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 3964538 + ... + 4261403.
It is an arithmetic number, because the mean of its divisors is an integer number (153792211632).
Almost surely, 21221001100453 is an apocalyptic number.
It is an amenable number.
1221001100453 is a deficient number, since it is larger than the sum of its proper divisors (9336592603).
1221001100453 is an equidigital number, since it uses as much as digits as its factorization.
1221001100453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8227075.
The product of its (nonzero) digits is 240, while the sum is 20.
Adding to 1221001100453 its reverse (3540011001221), we get a palindrome (4761012101674).
The spelling of 1221001100453 in words is "one trillion, two hundred twenty-one billion, one million, one hundred thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •