Base | Representation |
---|---|
bin | 100000011111001111101… |
… | …0111011011110111110001 |
3 | 120210212022121120211001112 |
4 | 1000332133113123313301 |
5 | 1041124104023210421 |
6 | 13255131552043105 |
7 | 640411310034563 |
oct | 100763727336761 |
9 | 16725277524045 |
10 | 4465144741361 |
11 | 1471725889397 |
12 | 60145bb33495 |
13 | 2650a49cccc5 |
14 | 116185373333 |
15 | 7b236aee45b |
hex | 40f9f5dbdf1 |
4465144741361 has 4 divisors (see below), whose sum is σ = 4471514420724. Its totient is φ = 4458775062000.
The previous prime is 4465144741349. The next prime is 4465144741363. The reversal of 4465144741361 is 1631474415644.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2444641696225 + 2020503045136 = 1563535^2 + 1421444^2 .
It is a cyclic number.
It is not a de Polignac number, because 4465144741361 - 238 = 4190266834417 is a prime.
It is a super-2 number, since 2×44651447413612 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4465144741363) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3184838630 + ... + 3184840031.
It is an arithmetic number, because the mean of its divisors is an integer number (1117878605181).
Almost surely, 24465144741361 is an apocalyptic number.
It is an amenable number.
4465144741361 is a deficient number, since it is larger than the sum of its proper divisors (6369679363).
4465144741361 is an equidigital number, since it uses as much as digits as its factorization.
4465144741361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6369679362.
The product of its digits is 3870720, while the sum is 50.
The spelling of 4465144741361 in words is "four trillion, four hundred sixty-five billion, one hundred forty-four million, seven hundred forty-one thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •