Base | Representation |
---|---|
bin | 10101000101010100111… |
… | …011111000010000000001 |
3 | 12010111200101022001200021 |
4 | 111011110323320100001 |
5 | 142214200203234133 |
6 | 3025325520453441 |
7 | 206450221660153 |
oct | 25052473702001 |
9 | 5114611261607 |
10 | 1448828961793 |
11 | 5094991a5a74 |
12 | 1b4961a7a281 |
13 | a6815b82985 |
14 | 501a35c8ad3 |
15 | 27a49cda52d |
hex | 15154ef8401 |
1448828961793 has 8 divisors (see below), whose sum is σ = 1454048639136. Its totient is φ = 1443609736800.
The previous prime is 1448828961761. The next prime is 1448828961823. The reversal of 1448828961793 is 3971698288441.
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 1448828961793 - 25 = 1448828961761 is a prime.
It is a super-3 number, since 3×14488289617933 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1448828961893) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 7139338 + ... + 7339468.
It is an arithmetic number, because the mean of its divisors is an integer number (181756079892).
Almost surely, 21448828961793 is an apocalyptic number.
It is an amenable number.
1448828961793 is a deficient number, since it is larger than the sum of its proper divisors (5219677343).
1448828961793 is a wasteful number, since it uses less digits than its factorization.
1448828961793 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 226175.
The product of its digits is 167215104, while the sum is 70.
The spelling of 1448828961793 in words is "one trillion, four hundred forty-eight billion, eight hundred twenty-eight million, nine hundred sixty-one thousand, seven hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •