Base | Representation |
---|---|
bin | 10011101101001100101… |
… | …000000010111111000101 |
3 | 11210110102112201011202020 |
4 | 103231030220002333011 |
5 | 134141400231432040 |
6 | 2514035551233353 |
7 | 166560226216554 |
oct | 23551450027705 |
9 | 4713375634666 |
10 | 1354200264645 |
11 | 482349822238 |
12 | 19a552b18859 |
13 | 9a915106457 |
14 | 49787a7dd9b |
15 | 2535c3eccd0 |
hex | 13b4ca02fc5 |
1354200264645 has 8 divisors (see below), whose sum is σ = 2166720423456. Its totient is φ = 722240141136.
The previous prime is 1354200264643. The next prime is 1354200264719. The reversal of 1354200264645 is 5464620024531.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1354200264645 - 21 = 1354200264643 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1354200264597 and 1354200264606.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1354200264643) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 45140008807 + ... + 45140008836.
It is an arithmetic number, because the mean of its divisors is an integer number (270840052932).
Almost surely, 21354200264645 is an apocalyptic number.
1354200264645 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1354200264645 is a deficient number, since it is larger than the sum of its proper divisors (812520158811).
1354200264645 is an equidigital number, since it uses as much as digits as its factorization.
1354200264645 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 90280017651.
The product of its (nonzero) digits is 691200, while the sum is 42.
The spelling of 1354200264645 in words is "one trillion, three hundred fifty-four billion, two hundred million, two hundred sixty-four thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •