Base | Representation |
---|---|
bin | 10011000110001101001… |
… | …001011111110001111001 |
3 | 11122110100202020221220011 |
4 | 103012031021133301321 |
5 | 133000124233232301 |
6 | 2442513312501521 |
7 | 163545560213512 |
oct | 23061511376171 |
9 | 4573322227804 |
10 | 1312333102201 |
11 | 466614907440 |
12 | 19240984a8a1 |
13 | 969a2279a54 |
14 | 47735515a09 |
15 | 2420ba42a51 |
hex | 1318d25fc79 |
1312333102201 has 16 divisors (see below), whose sum is σ = 1434016692288. Its totient is φ = 1191046982400.
The previous prime is 1312333102123. The next prime is 1312333102207. The reversal of 1312333102201 is 1022013332131.
It is a de Polignac number, because none of the positive numbers 2k-1312333102201 is a prime.
It is a super-2 number, since 2×13123331022012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1312333102207) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 45972805 + ... + 46001341.
It is an arithmetic number, because the mean of its divisors is an integer number (89626043268).
Almost surely, 21312333102201 is an apocalyptic number.
1312333102201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1312333102201 is a deficient number, since it is larger than the sum of its proper divisors (121683590087).
1312333102201 is a wasteful number, since it uses less digits than its factorization.
1312333102201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35352.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 1312333102201 its reverse (1022013332131), we get a palindrome (2334346434332).
The spelling of 1312333102201 in words is "one trillion, three hundred twelve billion, three hundred thirty-three million, one hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •