Base | Representation |
---|---|
bin | 1011111011111011100001… |
… | …1110101100001011100111 |
3 | 1201110122220110121120201000 |
4 | 2332332320132230023213 |
5 | 3210011400324023221 |
6 | 43525103345204343 |
7 | 2523123260365605 |
oct | 276767036541347 |
9 | 51418813546630 |
10 | 13124220142311 |
11 | 41aaa50139233 |
12 | 157b68a9306b3 |
13 | 7427bb2815c5 |
14 | 335303a28875 |
15 | 17b5ced99e26 |
hex | befb87ac2e7 |
13124220142311 has 32 divisors (see below), whose sum is σ = 20474784000000. Its totient is φ = 8292287434464.
The previous prime is 13124220142309. The next prime is 13124220142361. The reversal of 13124220142311 is 11324102242131.
13124220142311 is a `hidden beast` number, since 1 + 3 + 1 + 2 + 4 + 220 + 1 + 423 + 11 = 666.
It is not a de Polignac number, because 13124220142311 - 21 = 13124220142309 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13124220142361) 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, 96877311 + ... + 97012688.
It is an arithmetic number, because the mean of its divisors is an integer number (639837000000).
Almost surely, 213124220142311 is an apocalyptic number.
13124220142311 is a deficient number, since it is larger than the sum of its proper divisors (7350563857689).
13124220142311 is a wasteful number, since it uses less digits than its factorization.
13124220142311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 193890140 (or 193890134 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
Adding to 13124220142311 its reverse (11324102242131), we get a palindrome (24448322384442).
The spelling of 13124220142311 in words is "thirteen trillion, one hundred twenty-four billion, two hundred twenty million, one hundred forty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •