Base | Representation |
---|---|
bin | 10001101010000111100… |
… | …001001110010101011101 |
3 | 11022000010201120000021201 |
4 | 101222013201032111131 |
5 | 124340123312123401 |
6 | 2325241523155501 |
7 | 153445350211252 |
oct | 21520741162535 |
9 | 4260121500251 |
10 | 1213454411101 |
11 | 428694420309 |
12 | 177213515b91 |
13 | 8a574b6c0ca |
14 | 42a3537d429 |
15 | 21870e9cb01 |
hex | 11a8784e55d |
1213454411101 has 8 divisors (see below), whose sum is σ = 1228835755520. Its totient is φ = 1198073595888.
The previous prime is 1213454411083. The next prime is 1213454411107. The reversal of 1213454411101 is 1011144543121.
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 1213454411101 - 223 = 1213446022493 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1213454411101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1213454411107) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6710860 + ... + 6889306.
It is an arithmetic number, because the mean of its divisors is an integer number (153604469440).
Almost surely, 21213454411101 is an apocalyptic number.
It is an amenable number.
1213454411101 is a deficient number, since it is larger than the sum of its proper divisors (15381344419).
1213454411101 is an equidigital number, since it uses as much as digits as its factorization.
1213454411101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 264603.
The product of its (nonzero) digits is 1920, while the sum is 28.
Adding to 1213454411101 its reverse (1011144543121), we get a palindrome (2224598954222).
The spelling of 1213454411101 in words is "one trillion, two hundred thirteen billion, four hundred fifty-four million, four hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •