Base | Representation |
---|---|
bin | 100000010101101001011… |
… | …1100011100001001010111 |
3 | 120201220010022011211201102 |
4 | 1000223102330130021113 |
5 | 1040304402010241401 |
6 | 13241442531020315 |
7 | 636051504142550 |
oct | 100532274341127 |
9 | 16656108154642 |
10 | 4444535243351 |
11 | 1463a0a304505 |
12 | 5b9469a3a69b |
13 | 26316bc82578 |
14 | 11518c151327 |
15 | 7a92c5db56b |
hex | 40ad2f1c257 |
4444535243351 has 8 divisors (see below), whose sum is σ = 5081611200384. Its totient is φ = 3807994874040.
The previous prime is 4444535243341. The next prime is 4444535243359. The reversal of 4444535243351 is 1533425354444.
4444535243351 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4444535243351 - 210 = 4444535242327 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4444535243296 and 4444535243305.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4444535243359) 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, 133879145 + ... + 133912338.
It is an arithmetic number, because the mean of its divisors is an integer number (635201400048).
Almost surely, 24444535243351 is an apocalyptic number.
4444535243351 is a deficient number, since it is larger than the sum of its proper divisors (637075957033).
4444535243351 is a wasteful number, since it uses less digits than its factorization.
4444535243351 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 267793861.
The product of its digits is 6912000, while the sum is 47.
The spelling of 4444535243351 in words is "four trillion, four hundred forty-four billion, five hundred thirty-five million, two hundred forty-three thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •