Base | Representation |
---|---|
bin | 1100111011110000110… |
… | …11011110111101010101 |
3 | 1120111002010221212022212 |
4 | 12131320123132331111 |
5 | 24240113414231401 |
6 | 540053331203205 |
7 | 44051461353506 |
oct | 6357033367525 |
9 | 1514063855285 |
10 | 444402102101 |
11 | 161519445951 |
12 | 72165446505 |
13 | 32ba370b639 |
14 | 1771b274bad |
15 | b85ead1dbb |
hex | 67786def55 |
444402102101 has 8 divisors (see below), whose sum is σ = 465828183744. Its totient is φ = 423480163680.
The previous prime is 444402102071. The next prime is 444402102211. The reversal of 444402102101 is 101201204444.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 444402102101 - 26 = 444402102037 is a prime.
It is a super-2 number, since 2×4444021021012 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (444402102301) 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, 126034001 + ... + 126037526.
It is an arithmetic number, because the mean of its divisors is an integer number (58228522968).
Almost surely, 2444402102101 is an apocalyptic number.
444402102101 is a gapful number since it is divisible by the number (41) formed by its first and last digit.
It is an amenable number.
444402102101 is a deficient number, since it is larger than the sum of its proper divisors (21426081643).
444402102101 is a wasteful number, since it uses less digits than its factorization.
444402102101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 252071611.
The product of its (nonzero) digits is 1024, while the sum is 23.
Adding to 444402102101 its reverse (101201204444), we get a palindrome (545603306545).
The spelling of 444402102101 in words is "four hundred forty-four billion, four hundred two million, one hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •