Base | Representation |
---|---|
bin | 10010111110100011101… |
… | …011001100101011101001 |
3 | 11121200011102221002001202 |
4 | 102332203223030223221 |
5 | 132331320000213113 |
6 | 2435034401053545 |
7 | 163135223313242 |
oct | 22764353145351 |
9 | 4550142832052 |
10 | 1304121101033 |
11 | 4630903aa413 |
12 | 1908b76272b5 |
13 | 95c93b39c6a |
14 | 47196a23cc9 |
15 | 23dcab1c258 |
hex | 12fa3accae9 |
1304121101033 has 16 divisors (see below), whose sum is σ = 1319805542400. Its totient is φ = 1288533906000.
The previous prime is 1304121101029. The next prime is 1304121101117. The reversal of 1304121101033 is 3301011214031.
It is a cyclic number.
It is not a de Polignac number, because 1304121101033 - 22 = 1304121101029 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1304121100996 and 1304121101014.
It is not an unprimeable number, because it can be changed into a prime (1304121101233) 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 15 ways as a sum of consecutive naturals, for example, 120400928 + ... + 120411758.
It is an arithmetic number, because the mean of its divisors is an integer number (82487846400).
Almost surely, 21304121101033 is an apocalyptic number.
It is an amenable number.
1304121101033 is a deficient number, since it is larger than the sum of its proper divisors (15684441367).
1304121101033 is a wasteful number, since it uses less digits than its factorization.
1304121101033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15188.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 1304121101033 its reverse (3301011214031), we get a palindrome (4605132315064).
The spelling of 1304121101033 in words is "one trillion, three hundred four billion, one hundred twenty-one million, one hundred one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •