Base | Representation |
---|---|
bin | 1011111100111011001100… |
… | …1111110011000100001010 |
3 | 1201112022000122101011110010 |
4 | 2333032303033303010022 |
5 | 3210301401412041300 |
6 | 43541011355532350 |
7 | 2524266652562250 |
oct | 277166317630412 |
9 | 51468018334403 |
10 | 13141312221450 |
11 | 4207221179276 |
12 | 1582a5aa5a0b6 |
13 | 7442b33740ba |
14 | 336085a365d0 |
15 | 17bc806aea50 |
hex | bf3b33f310a |
13141312221450 has 96 divisors (see below), whose sum is σ = 37250620807680. Its totient is φ = 3003374692800.
The previous prime is 13141312221419. The next prime is 13141312221463. The reversal of 13141312221450 is 5412221314131.
It is a super-2 number, since 2×131413122214502 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 8233105 + ... + 9698795.
It is an arithmetic number, because the mean of its divisors is an integer number (388027300080).
Almost surely, 213141312221450 is an apocalyptic number.
13141312221450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13141312221450 is an abundant number, since it is smaller than the sum of its proper divisors (24109308586230).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13141312221450 is a wasteful number, since it uses less digits than its factorization.
13141312221450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1474252 (or 1474247 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 30.
Adding to 13141312221450 its reverse (5412221314131), we get a palindrome (18553533535581).
The spelling of 13141312221450 in words is "thirteen trillion, one hundred forty-one billion, three hundred twelve million, two hundred twenty-one thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •