Base | Representation |
---|---|
bin | 10001110001100111110… |
… | …111000111101010101000 |
3 | 11022202221100121122110120 |
4 | 101301213313013222220 |
5 | 130003124340332012 |
6 | 2333053323243240 |
7 | 154152144003264 |
oct | 21614767075250 |
9 | 4282840548416 |
10 | 1221513214632 |
11 | 43104a401717 |
12 | 1788a2379520 |
13 | 8b25a6306c9 |
14 | 4319b7930a4 |
15 | 21b9371158c |
hex | 11c67dc7aa8 |
1221513214632 has 32 divisors (see below), whose sum is σ = 3111401587680. Its totient is φ = 399488598080.
The previous prime is 1221513214549. The next prime is 1221513214633. The reversal of 1221513214632 is 2364123151221.
It is a junction number, because it is equal to n+sod(n) for n = 1221513214593 and 1221513214602.
It is not an unprimeable number, because it can be changed into a prime (1221513214633) 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, 480153294 + ... + 480155837.
It is an arithmetic number, because the mean of its divisors is an integer number (97231299615).
Almost surely, 21221513214632 is an apocalyptic number.
1221513214632 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1221513214632 is an abundant number, since it is smaller than the sum of its proper divisors (1889888373048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1221513214632 is a wasteful number, since it uses less digits than its factorization.
1221513214632 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 960309193 (or 960309189 counting only the distinct ones).
The product of its digits is 17280, while the sum is 33.
Adding to 1221513214632 its reverse (2364123151221), we get a palindrome (3585636365853).
The spelling of 1221513214632 in words is "one trillion, two hundred twenty-one billion, five hundred thirteen million, two hundred fourteen thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •