Base | Representation |
---|---|
bin | 10011001000001001101… |
… | …100010011011000101101 |
3 | 11122122202101000111202020 |
4 | 103020021230103120231 |
5 | 133013414141220021 |
6 | 2443500514020353 |
7 | 163651421523510 |
oct | 23101154233055 |
9 | 4578671014666 |
10 | 1314422601261 |
11 | 467497322a70 |
12 | 1928b15776b9 |
13 | 96c4612c023 |
14 | 47892c2ad77 |
15 | 242d01d37c6 |
hex | 13209b1362d |
1314422601261 has 32 divisors (see below), whose sum is σ = 2206648037376. Its totient is φ = 676056360000.
The previous prime is 1314422601241. The next prime is 1314422601269. The reversal of 1314422601261 is 1621062244131.
It is a happy number.
It is not a de Polignac number, because 1314422601261 - 27 = 1314422601133 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1314422601269) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 28145685 + ... + 28192346.
It is an arithmetic number, because the mean of its divisors is an integer number (68957751168).
Almost surely, 21314422601261 is an apocalyptic number.
1314422601261 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1314422601261 is a deficient number, since it is larger than the sum of its proper divisors (892225436115).
1314422601261 is a wasteful number, since it uses less digits than its factorization.
1314422601261 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 56338153.
The product of its (nonzero) digits is 13824, while the sum is 33.
Adding to 1314422601261 its reverse (1621062244131), we get a palindrome (2935484845392).
The spelling of 1314422601261 in words is "one trillion, three hundred fourteen billion, four hundred twenty-two million, six hundred one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •