Base | Representation |
---|---|
bin | 10011000101001111101… |
… | …100001111010100100001 |
3 | 11122100200220002200100121 |
4 | 103011033230033110201 |
5 | 132441021304204213 |
6 | 2442223121120241 |
7 | 163511200166164 |
oct | 23051754172441 |
9 | 4570626080317 |
10 | 1311302022433 |
11 | 4661358959a7 |
12 | 192180489081 |
13 | 9686977a290 |
14 | 476785d7adb |
15 | 2419b27288d |
hex | 1314fb0f521 |
1311302022433 has 16 divisors (see below), whose sum is σ = 1427506206336. Its totient is φ = 1197350974080.
The previous prime is 1311302022391. The next prime is 1311302022529. The reversal of 1311302022433 is 3342202031131.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1311302022433 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1311302022398 and 1311302022407.
It is not an unprimeable number, because it can be changed into a prime (1311302023433) 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, 796813 + ... + 1804858.
It is an arithmetic number, because the mean of its divisors is an integer number (89219137896).
Almost surely, 21311302022433 is an apocalyptic number.
1311302022433 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1311302022433 is a deficient number, since it is larger than the sum of its proper divisors (116204183903).
1311302022433 is a wasteful number, since it uses less digits than its factorization.
1311302022433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2602104.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 1311302022433 its reverse (3342202031131), we get a palindrome (4653504053564).
The spelling of 1311302022433 in words is "one trillion, three hundred eleven billion, three hundred two million, twenty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •