Base | Representation |
---|---|
bin | 10010111011101010010… |
… | …011111001111110010101 |
3 | 11121101010201010020202022 |
4 | 102323222103321332111 |
5 | 132303432332211013 |
6 | 2433402025222525 |
7 | 162665161552025 |
oct | 22735223717625 |
9 | 4541121106668 |
10 | 1301011210133 |
11 | 461834a02348 |
12 | 19018a031a45 |
13 | 958b975ac2b |
14 | 46d7d9b3a85 |
15 | 23c97abd008 |
hex | 12eea4f9f95 |
1301011210133 has 8 divisors (see below), whose sum is σ = 1316285439000. Its totient is φ = 1285802961408.
The previous prime is 1301011210127. The next prime is 1301011210141. The reversal of 1301011210133 is 3310121101031.
It can be written as a sum of positive squares in 4 ways, for example, as 84133063249 + 1216878146884 = 290057^2 + 1103122^2 .
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 1301011210133 - 24 = 1301011210117 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1301011210033) 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, 16455368 + ... + 16534241.
It is an arithmetic number, because the mean of its divisors is an integer number (164535679875).
Almost surely, 21301011210133 is an apocalyptic number.
It is an amenable number.
1301011210133 is a deficient number, since it is larger than the sum of its proper divisors (15274228867).
1301011210133 is a wasteful number, since it uses less digits than its factorization.
1301011210133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32990071.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 1301011210133 its reverse (3310121101031), we get a palindrome (4611132311164).
The spelling of 1301011210133 in words is "one trillion, three hundred one billion, eleven million, two hundred ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •