Base | Representation |
---|---|
bin | 10101000101010100111… |
… | …011111000010001001001 |
3 | 12010111200101022001202221 |
4 | 111011110323320101021 |
5 | 142214200203234430 |
6 | 3025325520454041 |
7 | 206450221660315 |
oct | 25052473702111 |
9 | 5114611261687 |
10 | 1448828961865 |
11 | 5094991a602a |
12 | 1b4961a7a321 |
13 | a6815b82a0c |
14 | 501a35c8b45 |
15 | 27a49cda57a |
hex | 15154ef8449 |
1448828961865 has 8 divisors (see below), whose sum is σ = 1738866915720. Its totient is φ = 1158881728512.
The previous prime is 1448828961823. The next prime is 1448828961887. The reversal of 1448828961865 is 5681698288441.
It can be written as a sum of positive squares in 4 ways, for example, as 22896834489 + 1425932127376 = 151317^2 + 1194124^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1448828961865 - 27 = 1448828961737 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1448828961794 and 1448828961803.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22644984 + ... + 22708873.
It is an arithmetic number, because the mean of its divisors is an integer number (217358364465).
Almost surely, 21448828961865 is an apocalyptic number.
It is an amenable number.
1448828961865 is a deficient number, since it is larger than the sum of its proper divisors (290037953855).
1448828961865 is an equidigital number, since it uses as much as digits as its factorization.
1448828961865 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45360251.
The product of its digits is 212336640, while the sum is 70.
The spelling of 1448828961865 in words is "one trillion, four hundred forty-eight billion, eight hundred twenty-eight million, nine hundred sixty-one thousand, eight hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •