Base | Representation |
---|---|
bin | 111111001101111101001… |
… | …111011000010111001001 |
3 | 120101022102122120110210101 |
4 | 333031331033120113021 |
5 | 1032134123124321301 |
6 | 13123425551045401 |
7 | 625603062145645 |
oct | 77157517302711 |
9 | 16338378513711 |
10 | 4344313120201 |
11 | 142545a555a5a |
12 | 5a1b59810861 |
13 | 256889440c12 |
14 | 1103a17cdc25 |
15 | 78013b27701 |
hex | 3f37d3d85c9 |
4344313120201 has 8 divisors (see below), whose sum is σ = 4399376635520. Its totient is φ = 4289251410288.
The previous prime is 4344313120141. The next prime is 4344313120207. The reversal of 4344313120201 is 1020213134434.
It is a happy number.
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 4344313120201 - 27 = 4344313120073 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4344313120201.
It is not an unprimeable number, because it can be changed into a prime (4344313120207) 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, 4772395 + ... + 5609311.
It is an arithmetic number, because the mean of its divisors is an integer number (549922079440).
Almost surely, 24344313120201 is an apocalyptic number.
It is an amenable number.
4344313120201 is a deficient number, since it is larger than the sum of its proper divisors (55063515319).
4344313120201 is an equidigital number, since it uses as much as digits as its factorization.
4344313120201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 902703.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 4344313120201 its reverse (1020213134434), we get a palindrome (5364526254635).
The spelling of 4344313120201 in words is "four trillion, three hundred forty-four billion, three hundred thirteen million, one hundred twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •