Base | Representation |
---|---|
bin | 10011100001000110010… |
… | …111010100010100100100 |
3 | 11202012220020211022102211 |
4 | 103201012113110110210 |
5 | 133433244320022040 |
6 | 2504050555413204 |
7 | 165620304365443 |
oct | 23410627242444 |
9 | 4665806738384 |
10 | 1341210314020 |
11 | 477893291055 |
12 | 197b28754204 |
13 | 99624b42935 |
14 | 48cb47acd5a |
15 | 24d4bcd38ea |
hex | 138465d4524 |
1341210314020 has 48 divisors (see below), whose sum is σ = 2902857914880. Its totient is φ = 520252377984.
The previous prime is 1341210314011. The next prime is 1341210314033. The reversal of 1341210314020 is 204130121431.
It is a junction number, because it is equal to n+sod(n) for n = 1341210313982 and 1341210314000.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6442584 + ... + 6647503.
It is an arithmetic number, because the mean of its divisors is an integer number (60476206560).
Almost surely, 21341210314020 is an apocalyptic number.
1341210314020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1341210314020 is an abundant number, since it is smaller than the sum of its proper divisors (1561647600860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1341210314020 is a wasteful number, since it uses less digits than its factorization.
1341210314020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13090252 (or 13090250 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 1341210314020 its reverse (204130121431), we get a palindrome (1545340435451).
The spelling of 1341210314020 in words is "one trillion, three hundred forty-one billion, two hundred ten million, three hundred fourteen thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •