Base | Representation |
---|---|
bin | 10011100110011110010… |
… | …000111011100100000000 |
3 | 11202202210100111211111000 |
4 | 103212132100323210000 |
5 | 134032103340031143 |
6 | 2510443304052000 |
7 | 166213264051362 |
oct | 23463620734400 |
9 | 4682710454430 |
10 | 1346980002048 |
11 | 47a28410606a |
12 | 199078a64000 |
13 | 9a0342a0415 |
14 | 492a0b88d32 |
15 | 250885c5bd3 |
hex | 1399e43b900 |
1346980002048 has 144 divisors (see below), whose sum is σ = 4111749644800. Its totient is φ = 434509608960.
The previous prime is 1346980002047. The next prime is 1346980002101. The reversal of 1346980002048 is 8402000896431.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (144).
It is a junction number, because it is equal to n+sod(n) for n = 1346980001994 and 1346980002012.
It is not an unprimeable number, because it can be changed into a prime (1346980002041) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2928883 + ... + 3357426.
Almost surely, 21346980002048 is an apocalyptic number.
1346980002048 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
1346980002048 is an abundant number, since it is smaller than the sum of its proper divisors (2764769642752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1346980002048 is an equidigital number, since it uses as much as digits as its factorization.
1346980002048 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6286365 (or 6286345 counting only the distinct ones).
The product of its (nonzero) digits is 331776, while the sum is 45.
Adding to 1346980002048 its reverse (8402000896431), we get a palindrome (9748980898479).
The spelling of 1346980002048 in words is "one trillion, three hundred forty-six billion, nine hundred eighty million, two thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •