Base | Representation |
---|---|
bin | 10010111011101010011… |
… | …011011110100011000110 |
3 | 11121101010211212002102001 |
4 | 102323222123132203012 |
5 | 132303433334214300 |
6 | 2433402135535514 |
7 | 162665214456460 |
oct | 22735233364306 |
9 | 4541124762361 |
10 | 1301013194950 |
11 | 461836038597 |
12 | 19018a82a59a |
13 | 958b9ca4491 |
14 | 46d7dd6d130 |
15 | 23c97d6116a |
hex | 12eea6de8c6 |
1301013194950 has 24 divisors (see below), whose sum is σ = 2765582335152. Its totient is φ = 446061666720.
The previous prime is 1301013194933. The next prime is 1301013194951. The reversal of 1301013194950 is 594913101031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1301013194951) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1858589929 + ... + 1858590628.
It is an arithmetic number, because the mean of its divisors is an integer number (115232597298).
Almost surely, 21301013194950 is an apocalyptic number.
1301013194950 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1301013194950 is an abundant number, since it is smaller than the sum of its proper divisors (1464569140202).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1301013194950 is a wasteful number, since it uses less digits than its factorization.
1301013194950 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3717180576 (or 3717180571 counting only the distinct ones).
The product of its (nonzero) digits is 14580, while the sum is 37.
Adding to 1301013194950 its reverse (594913101031), we get a palindrome (1895926295981).
The spelling of 1301013194950 in words is "one trillion, three hundred one billion, thirteen million, one hundred ninety-four thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •