Base | Representation |
---|---|
bin | 10010111011110000111… |
… | …010111010111110001100 |
3 | 11121101102102210002121100 |
4 | 102323300322322332030 |
5 | 132304144224214012 |
6 | 2433421030103100 |
7 | 163001006244300 |
oct | 22736072727614 |
9 | 4541372702540 |
10 | 1301122101132 |
11 | 4618915623a7 |
12 | 1901bb1aaa90 |
13 | 959067159c9 |
14 | 46d905dbd00 |
15 | 23ca26c48dc |
hex | 12ef0ebaf8c |
1301122101132 has 108 divisors (see below), whose sum is σ = 3826996236336. Its totient is φ = 371644459200.
The previous prime is 1301122101107. The next prime is 1301122101193. The reversal of 1301122101132 is 2311012211031.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 6271257 + ... + 6475407.
Almost surely, 21301122101132 is an apocalyptic number.
1301122101132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1301122101132, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1913498118168).
1301122101132 is an abundant number, since it is smaller than the sum of its proper divisors (2525874135204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1301122101132 is a wasteful number, since it uses less digits than its factorization.
1301122101132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 207788 (or 207776 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 1301122101132 its reverse (2311012211031), we get a palindrome (3612134312163).
The spelling of 1301122101132 in words is "one trillion, three hundred one billion, one hundred twenty-two million, one hundred one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •