Base | Representation |
---|---|
bin | 10011000110111100000… |
… | …011010110111001101011 |
3 | 11122112101120222122002110 |
4 | 103012330003112321223 |
5 | 133003232211201443 |
6 | 2443123343133403 |
7 | 163604224011630 |
oct | 23067403267153 |
9 | 4575346878073 |
10 | 1313120022123 |
11 | 466989023a88 |
12 | 1925a92a4263 |
13 | 96a99300140 |
14 | 477abc38187 |
15 | 24255b84233 |
hex | 131bc0d6e6b |
1313120022123 has 32 divisors (see below), whose sum is σ = 2163448852992. Its totient is φ = 689875200000.
The previous prime is 1313120022113. The next prime is 1313120022143. The reversal of 1313120022123 is 3212200213131.
It is not a de Polignac number, because 1313120022123 - 24 = 1313120022107 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 1313120022123.
It is not an unprimeable number, because it can be changed into a prime (1313120022103) 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, 9513078 + ... + 9650123.
It is an arithmetic number, because the mean of its divisors is an integer number (67607776656).
Almost surely, 21313120022123 is an apocalyptic number.
1313120022123 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1313120022123 is a deficient number, since it is larger than the sum of its proper divisors (850328830869).
1313120022123 is a wasteful number, since it uses less digits than its factorization.
1313120022123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19163475.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 1313120022123 its reverse (3212200213131), we get a palindrome (4525320235254).
The spelling of 1313120022123 in words is "one trillion, three hundred thirteen billion, one hundred twenty million, twenty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •