Base | Representation |
---|---|
bin | 1011111100110110011001… |
… | …0110110011001011111010 |
3 | 1201112011200201222212020020 |
4 | 2333031212112303023322 |
5 | 3210241231141230242 |
6 | 43540235354311310 |
7 | 2524222666636626 |
oct | 277154626631372 |
9 | 51464621885206 |
10 | 13140022211322 |
11 | 4206719a845a6 |
12 | 158275aa28536 |
13 | 7441390261b6 |
14 | 335da2596186 |
15 | 17bc072e46ec |
hex | bf3665b32fa |
13140022211322 has 8 divisors (see below), whose sum is σ = 26280044422656. Its totient is φ = 4380007403772.
The previous prime is 13140022211321. The next prime is 13140022211333. The reversal of 13140022211322 is 22311222004131.
It is a sphenic number, since it is the product of 3 distinct primes.
13140022211322 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 13140022211292 and 13140022211301.
It is not an unprimeable number, because it can be changed into a prime (13140022211321) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1095001850938 + ... + 1095001850949.
It is an arithmetic number, because the mean of its divisors is an integer number (3285005552832).
Almost surely, 213140022211322 is an apocalyptic number.
13140022211322 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13140022211322 is a wasteful number, since it uses less digits than its factorization.
13140022211322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2190003701892.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 13140022211322 its reverse (22311222004131), we get a palindrome (35451244215453).
The spelling of 13140022211322 in words is "thirteen trillion, one hundred forty billion, twenty-two million, two hundred eleven thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •